import itertools

n = int(input())
C = [list(input()) for _ in range(n)]
# vec = [(1, 0), (0, 1)]
D = []
count = 0
for i in range(1 << (2 * (n - 1))):
    D = []
    for j in range(2 * (n - 1)):
        if (i >> j) & 1:
            D.append(j)
    if len(D) == n - 1:
        x = 0
        y = 0
        S = [C[0][0]]
        for k in range(2 * (n - 1)):
            if k in D:
                x += 1
            else:
                y += 1
            S.append(C[y][x])
        if S == S[::-1]:
            count += 1
print(count % 998244353)