#include <bits/stdc++.h>
using namespace std;
#define rep(i, x, limit) for (int i = (int)x; i < (int)limit; i++)
#define REP(i, x, limit) for (int i = (int)x; i <= (int)limit; i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define el '\n'
#define spa " "
#define Yes cout << "Yes" << el
#define No cout << "No" << el
#define YES cout << "YES" << el
#define NO cout << "NO" << el
#define eps (1e-10)
#define Equals(a,b) (fabs((a) - (b)) < eps )
#define debug(x) cerr << #x << " = " << x << el
using ll = long long;
using ull = unsigned long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using vs = vector<string>;
using vb = vector<bool>;
const double pi = 3.141592653589793238;
const int inf = 1073741823;
const ll infl = 1LL << 60;
const string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const string abc = "abcdefghijklmnopqrstuvwxyz";
const ll MOD = 998244353;
#include<atcoder/all>
using namespace atcoder;
using mint = modint998244353;
using vm = vector<mint>;

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  ll n;cin>>n;
  vs C(n);
  rep(i,0,n)cin>>C[i];
  map<tuple<string,ll,ll>,ll>mp1,mp2;
  vl X={1,0,-1,0},Y={0,1,0,-1};
  auto dfs=[&](auto&&f,string s,ll x,ll y){
    s+=C[x][y];
    if(s.length()==n){
      mp1[{s,x,y}]++;
      return;
    }
    rep(i,0,2){
      f(f,s,x+X[i],y+Y[i]);
    }
  };
  dfs(dfs,"",0,0);
  auto dfs1=[&](auto&&f,string s,ll x,ll y){
    s+=C[x][y];
    if(s.length()==n){
      mp2[{s,x,y}]++;
      return;
    }
    rep(i,2,4){
      f(f,s,x+X[i],y+Y[i]);
    }
  };
  dfs1(dfs1,"",n-1,n-1);
  mint ans=0;
  for(auto &[T,a]:mp1){
    ans+=a*mp2[T];
  }
  cout<<ans.val()<<el;
}