Problem: Ordinary Jigsaw puzzles are solved with visual hints; players solve a puzzle with the picture which the puzzle shows on finish, and the diverse patterns of pieces. Such Jigsaw puzzles may be suitable for human players, because they require abilities of pattern recognition and imagination.

On the other hand, "Jigsaw puzzles" described below may be just the things for simple-minded computers.

As shown in Figure 1, a puzzle is composed of nine square pieces, and each of the four edges of a piece is labeled with one of the following eight symbols:

"R", "G", "B", "W", "r", "g", "b", and "w".


<image>
---
Figure 1: The nine pieces of a puzzle

In a completed puzzle, the nine pieces are arranged in a 3 x 3 grid, and each of the 12 pairs of edges facing each other must be labeled with one of the following four combinations of symbols:

"R" with "r", "G" with "g", "B" with "b", and "W" with "w".

For example, an edge labeled "R" can only face an edge with "r". Figure 2 is an example of a completed state of a puzzle. In the figure, edges under this restriction are indicated by shadowing their labels. The player can freely move and rotate the pieces, but cannot turn them over. There are no symbols on the reverse side of a piece !

<image>
---
Figure 2: A completed puzzle example

Each piece is represented by a sequence of the four symbols on the piece, starting with the symbol of the top edge, followed by the symbols of the right edge, the bottom edge, and the left edge. For example, gwgW represents the leftmost piece in Figure 1. Note that the same piece can be represented as wgWg, gWgw or Wgwg since you can rotate it in 90, 180 or 270 degrees.

The mission for you is to create a program which counts the number of solutions. It is needless to say that these numbers must be multiples of four, because, as shown in Figure 3, a configuration created by rotating a solution in 90, 180 or 270 degrees is also a solution.

<image>
---
Figure 3: Four obvious variations for a completed puzzle

A term "rotationally equal" is defined; if two different pieces are identical when one piece is rotated (in 90, 180 or 270 degrees), they are rotationally equal. For example, WgWr and WrWg are rotationally equal.

Another term "rotationally symmetric" is defined; if a piece is rotationally equal to itself, it is rotationally symmetric. For example, a piece gWgW is rotationally symmetric.


Given puzzles satisfy the following three conditions:

1. There is no identical pair of pieces in a puzzle.
2. There is no rotationally equal pair of pieces in a puzzle.
3. There is no rotationally symmetric piece in a puzzle.



Input

The input consists of multiple puzzles.


	N

	Puzzle1

	Puzzle2

	. . .

	PuzzleN



N is the number of puzzles. Each Puzzlei gives a puzzle with a single line of 44 characters, consisting of four-character representations of the nine pieces of the puzzle, separated by a space character. For example, the following line represents the puzzle in Figure 1.



	gwgW RBbW GWrb GRRb BWGr Rbgw rGbR gBrg GRwb


Output

For each Puzzlei , the number of its solutions should be the output, each in a separate line.

Example

Input

6
WwRR wwrg RRGb rGBG RGrb RrRg RGrg rgBB Wrgr
RrGb WWGR rGgb Wbrg wgBb GgBg WbBG Wwwg WWGG
RBbr Wrbr wGGG wggR WgGR WBWb WRgB wBgG WBgG
wBrg rGgb WRrB WWbw wRRB RbbB WRrb wrbb WgrG
WrwB WWww wRRB WGGb Wbbg WBgG WrbG Wrww RBgg
WWgg RBrr Rggr RGBg Wbgr WGbg WBbr WGWB GGGg


Output

40
8
32
4
12
0

Solution (in CPP):

Solution:
#define _USE_MATH_DEFINES
#define INF 0x3f3f3f3f
#include <cstdio>
#include <iostream>
#include <sstream>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <queue>
#include <stack>
#include <limits>
#include <map>
#include <string>
#include <cstring>
#include <set>
#include <deque>
#include <bitset>
#include <list>
#include <cctype>
#include <utility>

using namespace std;

typedef long long ll;
typedef pair <int,int> P;
typedef pair <int,P > PP;

int tx[] = {0,1,0,-1};
int ty[] = {-1,0,1,0};

static const double EPS = 1e-8;

int gSum = 0;
int key[24];

class Piece{
public:
	int pos[4];
	Piece(){
		memset(pos,0,sizeof(pos));
	}
};

bool check(char pos){
	if(pos == 0) return true;
	//012
	//345
	//678

	else if(pos==1){
		return (key[0] + key[1]==0);
	}

	else if(pos==2){
		return  (key[2] + key[3]==0);
	}

	else if(pos==3){
		return (key[4] + key[7]==0);
	}

	else if(pos==4){
		return ((key[5] + key[8]==0)
			&& (key[10] + key[11]==0));
	}
	else if(pos==5){
		return ((key[6] + key[9]==0)
			&& (key[12] + key[13]==0));
	}

	else if(pos==6){
		return (key[14] + key[17]==0);
	}

	else if(pos==7){
		return ((key[15] + key[18]==0)
			&& (key[20] + key[21]==0));
	}

	else if(pos==8){
		return ((key[16] + key[19]==0)
			&& (key[22] + key[23]==0));
	}
	else{
		return false;
	}
}

int dfs(char state,char puzzle[9][5],int visited){

	if(state==9){
		return 1;
	}

	int res = 0;

	for(int i=0;i<9;i++){
		if(visited & (1<<i)) continue;
		if(state==0){

			key[0] = puzzle[i][0];
			key[4] = puzzle[i][1];
			res += dfs(1,puzzle,visited | (1<<i));
			key[0] = puzzle[i][1];
			key[4] = puzzle[i][2];
			res += dfs(1,puzzle,visited | (1<<i));
			key[0] = puzzle[i][2];
			key[4] = puzzle[i][3];
			res += dfs(1,puzzle,visited | (1<<i));
			key[0] = puzzle[i][3];
			key[4] = puzzle[i][0];
			res += dfs(1,puzzle,visited | (1<<i));
		}
		else if(state==1){

			key[2] = puzzle[i][0];
			key[5] = puzzle[i][1];
			key[1] = puzzle[i][2];
			if(check(state)) res += dfs(state+1,puzzle,visited | (1<<i));

			key[2] = puzzle[i][1];
			key[5] = puzzle[i][2];
			key[1] = puzzle[i][3];
			if(check(state)) res += dfs(state+1,puzzle,visited | (1<<i));

			key[2] = puzzle[i][2];
			key[5] = puzzle[i][3];
			key[1] = puzzle[i][0];
			if(check(state)) res += dfs(state+1,puzzle,visited | (1<<i));

			key[2] = puzzle[i][3];
			key[5] = puzzle[i][0];
			key[1] = puzzle[i][1];
			if(check(state)) res += dfs(state+1,puzzle,visited | (1<<i));
		}
		else if(state==2){  
			key[6] = puzzle[i][0];
			key[3] = puzzle[i][1];
			if(check(state)) res += dfs(state+1,puzzle,visited | (1<<i));

			key[6] = puzzle[i][1];
			key[3] = puzzle[i][2];
			if(check(state)) res += dfs(state+1,puzzle,visited | (1<<i));

			key[6] = puzzle[i][2];
			key[3] = puzzle[i][3];
			if(check(state)) res += dfs(state+1,puzzle,visited | (1<<i));

			key[6] = puzzle[i][3];
			key[3] = puzzle[i][0];
			if(check(state)) res += dfs(state+1,puzzle,visited | (1<<i));
		}
		else if(state==3){

			key[7] = puzzle[i][0];
			key[10] = puzzle[i][1];
			key[14] = puzzle[i][2];
			if(check(state)) res += dfs(state+1,puzzle,visited | (1<<i));

			key[7] = puzzle[i][1];
			key[10] = puzzle[i][2];
			key[14] = puzzle[i][3];
			if(check(state)) res += dfs(state+1,puzzle,visited | (1<<i));

			key[7] = puzzle[i][2];
			key[10] = puzzle[i][3];
			key[14] = puzzle[i][0];
			if(check(state)) res += dfs(state+1,puzzle,visited | (1<<i));

			key[7] = puzzle[i][3];
			key[10] = puzzle[i][0];
			key[14] = puzzle[i][1];
			if(check(state)) res += dfs(state+1,puzzle,visited | (1<<i));
		}
		else if(state==4){
			key[8] = puzzle[i][0];
			key[12] = puzzle[i][1];
			key[15] = puzzle[i][2];
			key[11] = puzzle[i][3];
			if(check(state)) res += dfs(state+1,puzzle,visited | (1<<i));

			key[8] = puzzle[i][1];
			key[12] = puzzle[i][2];
			key[15] = puzzle[i][3];
			key[11] = puzzle[i][0];
			if(check(state)) res += dfs(state+1,puzzle,visited | (1<<i));

			key[8] = puzzle[i][2];
			key[12] = puzzle[i][3];
			key[15] = puzzle[i][0];
			key[11] = puzzle[i][1];
			if(check(state)) res += dfs(state+1,puzzle,visited | (1<<i));

			key[8] = puzzle[i][3];
			key[12] = puzzle[i][0];
			key[15] = puzzle[i][1];
			key[11] = puzzle[i][2];
			if(check(state)) res += dfs(state+1,puzzle,visited | (1<<i));
		}
		else if(state==5){
			key[16] = puzzle[i][0];
			key[13] = puzzle[i][1];
			key[9] = puzzle[i][2];
			if(check(state)) res += dfs(state+1,puzzle,visited | (1<<i));

			key[16] = puzzle[i][1];
			key[13] = puzzle[i][2];
			key[9] = puzzle[i][3];
			if(check(state)) res += dfs(state+1,puzzle,visited | (1<<i));

			key[16] = puzzle[i][2];
			key[13] = puzzle[i][3];
			key[9] = puzzle[i][0];
			if(check(state)) res += dfs(state+1,puzzle,visited | (1<<i));

			key[16] = puzzle[i][3];
			key[13] = puzzle[i][0];
			key[9] = puzzle[i][1];
			if(check(state)) res += dfs(state+1,puzzle,visited | (1<<i));

		}
		else if(state==6){
			key[17] = puzzle[i][0];
			key[20] = puzzle[i][1];
			if(check(state)) res += dfs(state+1,puzzle,visited | (1<<i));

			key[17] = puzzle[i][1];
			key[20] = puzzle[i][2];
			if(check(state)) res += dfs(state+1,puzzle,visited | (1<<i));

			key[17] = puzzle[i][2];
			key[20] = puzzle[i][3];
			if(check(state)) res += dfs(state+1,puzzle,visited | (1<<i));

			key[17] = puzzle[i][3];
			key[20] = puzzle[i][0];
			if(check(state)) res += dfs(state+1,puzzle,visited | (1<<i));
		}
		else if(state==7){
			key[21] = puzzle[i][0];
			key[18] = puzzle[i][1];
			key[22] = puzzle[i][2];
			if(check(state)) res += dfs(state+1,puzzle,visited | (1<<i));

			key[21] = puzzle[i][1];
			key[18] = puzzle[i][2];
			key[22] = puzzle[i][3];
			if(check(state)) res += dfs(state+1,puzzle,visited | (1<<i));

			key[21] = puzzle[i][2];
			key[18] = puzzle[i][3];
			key[22] = puzzle[i][0];
			if(check(state)) res += dfs(state+1,puzzle,visited | (1<<i));

			key[21] = puzzle[i][3];
			key[18] = puzzle[i][0];
			key[22] = puzzle[i][1];
			if(check(state)) res += dfs(state+1,puzzle,visited | (1<<i));
		}
		else if(state==8){
			key[23] = puzzle[i][0];
			key[19] = puzzle[i][1];
			if(check(state)) res += dfs(state+1,puzzle,visited | (1<<i));

			key[23] = puzzle[i][1];
			key[19] = puzzle[i][2];
			if(check(state)) res += dfs(state+1,puzzle,visited | (1<<i));

			key[23] = puzzle[i][2];
			key[19] = puzzle[i][3];
			if(check(state)) res += dfs(state+1,puzzle,visited | (1<<i));

			key[23] = puzzle[i][3];
			key[19] = puzzle[i][0];
			if(check(state)) res += dfs(state+1,puzzle,visited | (1<<i));
		}
	}
	return res;
}

char table[256];

int main(){
	int n;

	table['r'] = 1;
	table['g'] = 2;
	table['b'] = 3;
	table['w'] = 4;
	table['R'] = -1;
	table['G'] = -2;
	table['B'] = -3;
	table['W'] = -4;

	while(~scanf("%d",&n)){
		for(int i=0;i<n;i++){

			char puzzle[9][5];
			char buf[5];
			for(int j=0;j<9;j++){

				scanf("%s",buf);
				for(int k=0;k<4;k++){
					puzzle[j][k] = table[buf[k]];
				}
			}

			printf("%d\n",dfs(0,puzzle,0));
		}
	}
}