#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using mint = atcoder::modint998244353;

mint dp[100][100][100][100];
int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n;
    cin >> n;
    vector<string> A(n);
    for(auto &&str : A) cin >> str;
    if(A[0][0] != A[n - 1][n - 1]){
        cout << "0\n";
        return 0;
    }
	auto B = A;
	reverse(B.begin(), B.end());
	for(auto &&str : B) reverse(str.begin(), str.end());
    dp[0][0][0][0] = 1;
    for(int a = 0; a + 1 < n; a++){
		for(int y1 = 0; y1 <= a; y1++){
			int x1 = a - y1;
			for(int y2 = 0; y2 <= a; y2++){
				int x2 = a - y2;
				if(A[y1][x1] != B[y2][x2]) continue;
				if(A[y1 + 1][x1] == B[y2 + 1][x2]) dp[y1 + 1][x1][y2 + 1][x2] += dp[y1][x1][y2][x2];
				if(A[y1 + 1][x1] == B[y2][x2 + 1]) dp[y1 + 1][x1][y2][x2 + 1] += dp[y1][x1][y2][x2];
				if(A[y1][x1 + 1] == B[y2 + 1][x2]) dp[y1][x1 + 1][y2 + 1][x2] += dp[y1][x1][y2][x2];
				if(A[y1][x1 + 1] == B[y2][x2 + 1]) dp[y1][x1 + 1][y2][x2 + 1] += dp[y1][x1][y2][x2];
			}
		}
	}
	mint ans;
	for(int y1 = 0; y1 < n; y1++){
		int x1 = n - 1 - y1;
		int y2 = n - 1 - y1;
		int x2 = n - 1 - x1;
		ans += dp[y1][x1][y2][x2];
	}
	cout << ans.val() << '\n';
}