mod = 10**9+7
def f(y0, x0, y1, x1):
    return y0*n*n*n + x0*n*n + y1*n + x1
def g(a):
    return a//n//n//n, a//n//n%n, a//n%n, a%n
n = int(input()); assert 2 <= n <= 200
S = [input() for _ in range(n)]
from collections import defaultdict as Di
D = Di(int)
t = 0
if S[0][0] == S[-1][-1]:
    t += 1
D[f(0, 0, n-1, n-1)] = t

dy = [1, 0, -1, 0]
dx = [0, 1, 0, -1]

for _ in range(n-1):
    D_ = Di(int)
    for d in D:
        a = D[d]
        y0, x0, y1, x1 = g(d)
        for d0 in range(2):
            ny0, nx0 = y0+dy[d0], x0+dx[d0]
            if not (ny0 < n and nx0 < n):
                continue
            for d1 in range(2, 4):
                ny1, nx1 = y1+dy[d1], x1+dx[d1]
                if not (0 <= ny1 and 0 <= nx1):
                    continue
                if (_ < n-2 and S[ny0][nx0] == S[ny1][nx1]) or (_ == n-2 and (ny0, nx0) == (ny1, nx1)):
                    D_[f(ny0, nx0, ny1, nx1)] += a
                    D_[f(ny0, nx0, ny1, nx1)] %= mod
    D = D_
ans = 0
for d in D:
    ans = (ans + D[d]) % mod
print(ans)