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=Counter()
dp[0,0,n-1,n-1]=1
for _ in range(n-1):
    pre,dp=dp,Counter()
    for (i,j,r,c),v in pre.items():
        v%=md
        ni,nj,nr,nc=i+1,j,r-1,c
        if 0<=ni<n and 0<=nj<n and 0<=nr<n and 0<=nc<n and cc[ni][nj]==cc[nr][nc]:
            dp[ni,nj,nr,nc]+=v
        ni,nj,nr,nc=i+1,j,r,c-1
        if 0<=ni<n and 0<=nj<n and 0<=nr<n and 0<=nc<n and cc[ni][nj]==cc[nr][nc]:
            dp[ni,nj,nr,nc]+=v
        ni,nj,nr,nc=i,j+1,r-1,c
        if 0<=ni<n and 0<=nj<n and 0<=nr<n and 0<=nc<n and cc[ni][nj]==cc[nr][nc]:
            dp[ni,nj,nr,nc]+=v
        ni,nj,nr,nc=i,j+1,r,c-1
        if 0<=ni<n and 0<=nj<n and 0<=nr<n and 0<=nc<n and cc[ni][nj]==cc[nr][nc]:
            dp[ni,nj,nr,nc]+=v
ans=0
for (i, j, r, c), v in dp.items():
    if i==r and j==c:
        ans+=v
        ans%=md
print(ans)