--[----->+<]>.--[->+++<]>+...

-[--->+<]>-.[---->+++++<]>-.---.--[--->+<]>-.++[->+++<]>+.------.++++++++++++.--------.[->+++<]>-.

• Make a horizontal table consisting of endless 0's.
  Create a pointer that starts on the leftmost cell.


• With every solved module*, a new character will be shown. Apply the character's condition with the table.

*Some modules are ignored by Brainf---.

Symbol	Description
>	Move the pointer one cell to the right.
<	Move the pointer one cell to the left, or moving right if it's in the leftmost cell.
+	Add one to the pointer's cell.
-	Subtract one to the pointer's cell, or adding 1 if it's 0.
[ and ]	Anything inside the brackets is looped until either... ...the pointer's cell at the end of the loop is 0. ...the loop has been repeated (batteries + 1) times.
.	Input the last two digits of your pointer's cell and press OK. Submit "X" and not "0X" if a 1-digit number.
,	Take the value of the cell to the left of the pointer, or the right if the pointer is in the leftmost cell. Subtract with 6 until it's in range of 0 through 5, then add 1. Set the pointer's cell to the serial number. If the number recieved is 1, take the first character. If 2, take second... A B C D E F G H I J K L M 1 2 3 4 5 6 7 8 9 10 11 12 13 N O P Q R S T U V W X Y Z 14 15 16 17 18 19 20 21 22 23 24 25 26