MOD = 998244353

N = int(input())
C = [input() for _ in range(N)]

if C[0][0] != C[-1][-1]:
    exit(print(0))

dp = [[0]*N for _ in range(N)]
dp[0][N-1] = 1
for i in range(N-1):
    ndp = [[0]*N for _ in range(N)]
    for j in range(N):
        for k in range(N):
            if dp[j][k] == 0:
                continue
            h1, w1 = j, i-j
            h2, w2 = k, (N-1)-(i-(N-1-k))
            for a, b in [(1, 0), (0, 1)]:
                for c, d in [(1, 0), (0, 1)]:
                    if C[h1+a][w1+b] == C[h2-c][w2-d]:
                        if i < N-2:
                            ndp[j+a][k-c] += dp[j][k]
                            ndp[j+a][k-c] %= MOD
                        elif (h1+a, w1+b) == (h2-c, w2-d):
                            ndp[j+a][k-c] += dp[j][k]
                            ndp[j+a][k-c] %= MOD
    dp = ndp

ans = 0
for d in dp:
    ans += sum(d)
    ans %= MOD

print(ans)