import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;
 
public class Solution {
    private static int length;
    private static String[][] map;
    private static int result;
 
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
 
        for (int tc = 1; tc <= 10; tc++) {
            length = sc.nextInt();
            result = 0;
            map = new String[8][8];
 
            for (int i = 0; i < 8; i++) {
                String str = sc.next();
                map[i] = str.split("");
            }
 
            findPalindrome(true);
            findPalindrome(false);
            System.out.println("#" + tc + " " + result);
        }
    }
 
    private static void findPalindrome(boolean isRightCheck) {
        List<String> strList = new ArrayList<>();
 
        for (int i = 0; i < 8; i++) {
            int idx = length - 1;
            for (int j = 0; j < 8; j++) {
                if (isRightCheck) {
                    strList.add(map[i][j]);
                } else {
                    strList.add(map[j][i]);
                }
 
                if (strList.size() == length) {
                    if (isPalindrome(strList)) result++;
 
                    strList.remove(0);
                    j = idx++;
                }
            }
 
            strList.clear();
        }
    }
 
    private static boolean isPalindrome(List<String> strList) {
        int strLength = strList.size();
 
        for (int i = 0; i < strLength / 2; i++) {
            String checkStr1 = strList.get(i);
            String checkStr2 = strList.get(strLength - 1 - i);
 
            if (!checkStr1.equals(checkStr2)) return false;
        }
 
        return true;
    }
}