#include <bits/stdc++.h>
using namespace std;
using ll=long long;
#include <atcoder/modint>
using mint=atcoder::modint998244353;
int main(){
	int n;
	cin>>n;
	vector<string> s(n);
	for(int i=0;i<n;i++)cin>>s[i];
	if(s[0][0]!=s[n-1][n-1]){
		cout<<0<<endl;
		return 0;
	}
	vector<vector<mint>> dp(n*n,vector<mint>(n*n));
	dp[0][n*n-1]=1;
	for(int i=0;i<n-1;i++){
		for(int j=0;j<=i;j++){
			for(int k=0;k<=i;k++){
				int x1=j,y1=i-j,x2=n-k-1,y2=n-(i-k)-1;
				if(s[x1+1][y1]==s[x2-1][y2]){
					dp[(x1+1)*n+y1][(x2-1)*n+y2]+=dp[x1*n+y1][x2*n+y2];
				}
				if(s[x1][y1+1]==s[x2-1][y2]){
					dp[x1*n+y1+1][(x2-1)*n+y2]+=dp[x1*n+y1][x2*n+y2];
				}
				if(s[x1+1][y1]==s[x2][y2-1]){
					dp[(x1+1)*n+y1][(x2)*n+y2-1]+=dp[x1*n+y1][x2*n+y2];
				}
				if(s[x1][y1+1]==s[x2][y2-1]){
					dp[(x1)*n+y1+1][(x2)*n+y2-1]+=dp[x1*n+y1][x2*n+y2];
				}
			}
		}
	}
	mint ans=0;
	for(int i=0;i<n;i++)ans+=dp[i*n+(n-1-i)][i*n+(n-1-i)];
	cout<<ans.val()<<endl;
}