Problem Description
Following the hype generated by Rubiks Cube Norwegian Open Championship arranged at NTNU this year, each and every student at NTNU has bought such a cube. The professors, however, are dismayed, because the students rather play with their cube instead of listening to the professors lectures.
One professor suddenly gets the idea that if he gives the students a program to solve their cubes they may lose interest in it, so that it will be possible to start teaching again. Of course, the professor don't want to do the grunt work of programming, and you are the lucky assignee of this task.
The professor takes away your cube, locks you in a faraway laboratory and says that you won't get out until you have written a program to solve Rubiks cube.
Luckily, the professor did not specify the size of the cube, so you decide to make the work slightly easier by solving the Rubiks 2 2 2 cube.
Input
The first line of the input consists of a single number T, the number of test cases. Each test case consists of six lines describing the initial configuration of a cube, formatted exactly as in the example input. The characters used for colors are G, R, O, B, Y and W.
Each test case is followed by an empty line.
Output
For each scenario, output a line with the minimum number of moves that is necessecary to solve the cube. A move is turning one face of the cube 90 degrees clockwise or counter-clockwise. (A turn of 180 degrees is considered to be two moves.)
Notes and Constraints
0 < T <= 100
You may assume that all input cubes are scrambled versions of originally solved cubes with six diffierent colors. (Which means there are exactly four occurrences of each color and that it is possible to get the cube to a solved state using moves as described above.)
Sample Input
2
OO
OO
RR GG BB WW
RR GG BB WW
YY
YY
RR
RR
YY OO GG BB
OO GG BB YY
WW
WW
Sample Output
0
1
