import java.util.*;
import java.io.*;

public class C_matsu{
	public static void main(String args[]) throws IOException{
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		for(int i=0;i<n;i++){
			String pieceset[] = new String[9];
			for(int j=0;j<9;j++){
				pieceset[j] = sc.next();
			}
			Puzzle puz = new Puzzle(pieceset);
			puz.solve();
		}
	}
}

class Puzzle{
	int piece[][];
	int table[][];
	boolean unused[];
	int count;
	
	Puzzle(String pieceset[]){
		piece = new int[9][4];
		table = new int[9][2];
		unused = new boolean[9];
		for(int i=0;i<9;i++){
			unused[i] = true;
			for(int j=0;j<4;j++){
				piece[i][j] = charToInt(pieceset[i].charAt(j));
			}
		}
		count = 0;
	}
	
	private static int charToInt(char c){
		switch(c){
			case 'R':
				return 1;
			case 'r':
				return -1;
			case 'G':
				return 2;
			case 'g':
				return -2;
			case 'B':
				return 3;
			case 'b':
				return -3;
			case 'W':
				return 4;
			case 'w':
				return -4;
		}
		System.out.println("Input Error!");
		return Integer.MAX_VALUE;
	}
	
	public void solve(){
		set(0);
		System.out.println(count);
	}
	
	private void set(int i){
		for(int j=0;j<9;j++){
			if(unused[j]==false) continue;
			for(int k=0;k<4;k++){
				table[i][0] = j;
				table[i][1] = k;
				unused[j] = false;
				switch(i){
					case 0:
						set(1);
						unused[j] = true;
						continue;
					case 1:
						if(piece[(table[0][0])][(0+table[0][1])%4] + 
							piece[(table[1][0])][(2+table[1][1])%4] != 0){
							unused[j] = true;
							continue;
						}
						else{
							set(2);
							unused[j] = true;
							continue;
						}
					case 2:
						if(piece[(table[0][0])][(2+table[0][1])%4] + 
							piece[(table[2][0])][(0+table[2][1])%4] != 0){
							unused[j] = true;
							continue;
						}
						else{
							set(3);
							unused[j] = true;
							continue;
						}
					case 3:
						if(piece[(table[0][0])][(3+table[0][1])%4] + 
							piece[(table[3][0])][(1+table[3][1])%4] != 0){
							unused[j] = true;
							continue;
						}
						else{
							set(4);
							unused[j] = true;
							continue;
						}
					case 4:
						if(piece[(table[0][0])][(1+table[0][1])%4] + 
							piece[(table[4][0])][(3+table[4][1])%4] != 0){
							unused[j] = true;
							continue;
						}
						else{
							set(5);
							unused[j] = true;
							continue;
						}
					
					case 5:
						if(piece[(table[1][0])][(3+table[1][1])%4] + 
							piece[(table[5][0])][(1+table[5][1])%4] != 0){
							unused[j] = true;
							continue;
						}
						else if(piece[(table[3][0])][(0+table[3][1])%4] + 
							piece[(table[5][0])][(2+table[5][1])%4] != 0){
							unused[j] = true;
							continue;
						}
						else{
							set(6);
							unused[j] = true;
							continue;
						}
					case 6:
						if(piece[(table[1][0])][(1+table[1][1])%4] + 
							piece[(table[6][0])][(3+table[6][1])%4] != 0){
							unused[j] = true;
							continue;
						}
						else if(piece[(table[4][0])][(0+table[4][1])%4] + 
							piece[(table[6][0])][(2+table[6][1])%4] != 0){
							unused[j] = true;
							continue;
						}
						else{
							set(7);
							unused[j] = true;
							continue;
						}
					case 7:
						if(piece[(table[2][0])][(1+table[2][1])%4] + 
							piece[(table[7][0])][(3+table[7][1])%4] != 0){
							unused[j] = true;
							continue;
						}
						else if(piece[(table[4][0])][(2+table[4][1])%4] + 
							piece[(table[7][0])][(0+table[7][1])%4] != 0){
							unused[j] = true;
							continue;
						}
						else{
							set(8);
							unused[j] = true;
							continue;
						}
					case 8:
						if(piece[(table[2][0])][(3+table[2][1])%4] + 
							piece[(table[8][0])][(1+table[8][1])%4] != 0){
							unused[j] = true;
							continue;
						}
						else if(piece[(table[3][0])][(2+table[3][1])%4] + 
							piece[(table[8][0])][(0+table[8][1])%4] != 0){
							unused[j] = true;
							continue;
						}
						else{
							count++;
							unused[j] = true;
							continue;
						}
					default:
						System.out.println("Input Error!");
				}
			}
		}
	}
}