mod = 10**9+7
n = int(input()); assert 2 <= n <= 10
S = [input() for _ in range(n)]
from itertools import combinations as P
ans = 0
for per in P(range(2*n-2), n-1):
    y = x = 0
    T = [S[y][x]]
    A = [0] * (2*n-2)
    for i in per:
        A[i] = 1
    for i in range(2*n-2):
        if A[i]:
            y += 1
        else:
            x += 1
        T.append(S[y][x])
    T = "".join(T)
    if T == T[::-1]:
        ans += 1
print(ans)