On the Subject of _Play_

Multitask, but easy one.

1. Convert the seed from base-64 to base-2. If starting sign is +, prepend the string with a 1, if - - with a 0. You should end up with 67 bits.

   0	000000	G	010000	W	100000	m	110000
   1	000001	H	010001	X	100001	n	110001
   2	000010	I	010010	Y	100010	o	110010
   3	000011	J	010011	Z	100011	p	110011
   4	000100	K	010100	a	100100	q	110100
   5	000101	L	010101	b	100101	r	110101
   6	000110	M	010110	c	100110	s	110110
   7	000111	N	010111	d	100111	t	110111
   8	001000	O	-	e	101000	u	111000
   9	001001	P	011001	f	101001	v	111001
   A	001010	Q	011010	g	101010	w	111010
   B	001011	R	011011	h	101011	x	111011
   C	001100	S	011100	i	101100	y	111100
   D	001101	T	011101	j	101101	z	111101
   E	001110	U	011110	k	101110	<	111110
   F	001111	V	011111	l	-	>	111111

2. The big button has 4 child buttons, each one also has 4 child ones. Total amount of buttons: 21.
3. Each button has starting move and ending move. You must press every button twice, on both moves. Current move is displayed on the screen and can be incremented by fast-forward button.
4. Starting move of big button is always move 0.
5. Take first two bits out of seed and treat them as one number. Convert it to base-10 and add 1. Add it to starting move of the button. This is ending move of button.

6. For next 5 bits: look up in the table the corresponding list. Add the numbers to ending move of parent. These will be your starting moves of child buttons in reading order.

   00000	{1, 2, 3, 4}	01000	{2, 1, 3, 4}	10000	{3, 1, 2, 4}	11000	{4, 1, 2, 3}
   00001	{1, 2, 4, 3}	01001	{2, 1, 4, 3}	10001	{3, 1, 4, 2}	11001	{4, 1, 3, 2}
   00010	{1, 3, 2, 4}	01010	{2, 3, 1, 4}	10010	{3, 2, 1, 4}	11010	{4, 2, 1, 3}
   00011	{1, 3, 4, 2}	01011	{2, 3, 4, 1}	10011	{3, 2, 4, 1}	11011	{4, 2, 3, 1}
   00100	{1, 4, 2, 3}	01100	{2, 4, 1, 3}	10100	{3, 4, 1, 2}	11100	{4, 3, 1, 2}
   00101	{1, 4, 3, 2}	01101	{2, 4, 3, 1}	10101	{3, 4, 2, 1}	11101	{4, 3, 2, 1}
   00110	{1, 2, 3, 4}	01110	{2, 1, 3, 4}	10110	{3, 1, 2, 4}	11110	{4, 1, 2, 3}
   00111	{1, 2, 4, 3}	01111	{2, 1, 4, 3}	10111	{3, 1, 4, 2}	11111	{4, 1, 3, 2}

7. Next 8 bits: divide them into pairs. Do the same process as in step 5 for every button.
8. Next 20 bits: divide them into groups of 5 bits. Repeat the same process as in step 6. First 5 bits correspond to top-left button, second 5 - to top-right etc.
9. Next 32 bits: divide them into groups of 8 bits. Repeat the 7th step for every group.

After pressing all buttons twice at correct moves, module will solve.

If any button should be pressed at current move but fast-forward button was pressed, then module will strike. Also, if button shouldn't be pressed at current move, then module also will strike.