#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
#define ov4(a, b, c, d, name, ...) name
#define rep3(i, a, b, c) for(ll i = (a); i < (b); i += (c))
#define rep2(i, a, b) rep3(i, a, b, 1)
#define rep1(i, n) rep2(i, 0, n)
#define rep0(n) rep1(aaaaa, n)
#define rep(...) ov4(__VA_ARGS__, rep3, rep2, rep1, rep0)(__VA_ARGS__)
#define per(i, a, b) for(ll i = (a)-1; i >= (b); i--)
#define fore(e, v) for(auto&& e : v)
#define all(a) begin(a), end(a)
#define si(a) (int)(size(a))
#define lb(v, x) (lower_bound(all(v), x) - begin(v))
#define eb emplace_back

template<typename T, typename S> bool chmin(T& a, const S& b) { return a > b ? a = b, 1 : 0; }
template<typename T, typename S> bool chmax(T& a, const S& b) { return a < b ? a = b, 1 : 0; }

const int INF = 1e9 + 100;
const ll INFL = 3e18 + 100;

#define i128 __int128_t
constexpr int mod = 998244353;
struct mint {
   int x;
   mint(ll x_ = 0) : x(x_ % mod) {
      if(x < 0) x += mod;
   }
   mint operator-() {
      auto res = *this;
      res.x = (x ? mod - x : 0);
      return res;
   }
   mint& operator+=(mint r) {
      if((x += r.x) >= mod) x -= mod;
      return *this;
   }
   mint& operator-=(mint r) {
      if((x -= r.x) < 0) x += mod;
      return *this;
   }
   mint& operator*=(mint r) {
      x = 1LL * x * r.x % mod;
      return *this;
   }
   mint& operator/=(mint r) { return *this *= r.inv(); }
   friend mint operator+(mint a, mint b) { return a += b; }
   friend mint operator-(mint a, mint b) { return a -= b; }
   friend mint operator*(mint a, mint b) { return a *= b; }
   friend mint operator/(mint a, mint b) { return a /= b; }
   mint inv() const { return pow(mod - 2); }
   mint pow(ll b) const {
      mint a = *this, c = 1;
      while(b) {
         if(b & 1) c *= a;
         a *= a;
         b >>= 1;
      }
      return c;
   }
};
/*
aaaaa
aaaaa
aaaaa
aaaaa
aaaaa
*/
using vm = vector<mint>;
int main() { 
    cin.tie(0)->sync_with_stdio(0); 

    ll n;
    cin >> n;
    vector<string> s(n);
    rep(i,n){
        cin >> s[i];
    }
    vector<vector<mint>> dp(n);
    rep(i,n){
        vector<mint> temp((i+1)*(i+1),0);
        dp[i] = temp;
    }
    if(s[0][0] == s[n-1][n-1]){
        dp[0][0] = 1;
    }
    rep(i,n-1){
        rep(j,i+1){
            rep(k,i+1){
                ll idx = j * (i+1) + k;
                //cerr << i << ' ' << j << ' ' << k << endl;
                rep(jt,2)rep(kt,2){
                    ll jj = j + jt;
                    ll kk = k + kt;
                    ll jdx = jj * (i+2) + kk;
                    if(jj < i+2 && kk < i+2){
                        //cerr << i << ' ' << jj << ' ' << kk << endl;
                        char c1 = s[0+jj][(i+1)-jj];
                        char c2 = s[n-1-(i+1)+kk][n-1-kk];
                        if(c1 == c2){
                            dp[i+1][jdx] += dp[i][idx];
                        }
                    }
                }
            }
        }
    }
    mint ans = 0;
    rep(i,n){
        ans += dp.back()[i * (n) + i];
    }
    cout << ans.x << endl;

}