import sys

# sys.setrecursionlimit(200005)
# sys.set_int_max_str_digits(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()

dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
# inf = -1-(-1 << 31)
inf = -1-(-1 << 62)

# md = 10**9+7
md = 998244353

from collections import Counter

n=II()
cc=[SI() for _ in range(n)]

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

dp=[[1]]
for d in range(n-1):
    pre,dp=dp,[[0]*(d+2) for _ in range(d+2)]
    for i in range(d+1):
        for r in range(d+1):
            v=pre[i][r]
            if v==0:continue
            ni,nr=i,r
            if cc[ni][d+1-ni]==cc[n-1-nr][n-2-d+nr]:
                dp[ni][nr]+=v
                dp[ni][nr]%=md
            ni,nr=i,r+1
            if cc[ni][d+1-ni]==cc[n-1-nr][n-2-d+nr]:
                dp[ni][nr]+=v
                dp[ni][nr]%=md
            ni,nr=i+1,r
            if cc[ni][d+1-ni]==cc[n-1-nr][n-2-d+nr]:
                dp[ni][nr]+=v
                dp[ni][nr]%=md
            ni,nr=i+1,r+1
            if cc[ni][d+1-ni]==cc[n-1-nr][n-2-d+nr]:
                dp[ni][nr]+=v
                dp[ni][nr]%=md
    # p2D(dp)

ans=0
for i in range(n):
    ans+=dp[i][n-1-i]
    ans%=md
print(ans)