#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;
using mint = modint998244353;

mint dp[210][210], ndp[210][210];

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  vector<string> s(n);
  rep(i, n) cin >> s[i];
  dp[0][n-1] = 1;
  rep(sm, n - 1) {
    rep(j1, min(n-1, sm) + 1) if (int i1 = sm - j1; 0 <= i1 && i1 < n) rep(j2, min(n-1, n-1+n-1-sm) + 1) {
      int i2 = n-1+n-1-sm-j2;
      if (!(0 <= i2 && i2 < n)) continue;
      if (!dp[j1][j2].val()) continue;
      if (s[i1][j1] != s[i2][j2]) continue;
      ndp[j1][j2] += dp[j1][j2];
      ndp[j1+1][j2] += dp[j1][j2];
      if (j2) {
        ndp[j1][j2-1] += dp[j1][j2];
        ndp[j1+1][j2-1] += dp[j1][j2];
      }
    }
    rep(i, n) rep(j, n) dp[i][j] = ndp[i][j], ndp[i][j] = 0;
  }
  mint ans;
  rep(i, n) ans += dp[i][i];
  cout << ans.val() << '\n';
}