#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 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 ov4(a, b, c, d, name, ...) name
#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 sz(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
struct _ {
  _() { cin.tie(0)->sync_with_stdio(0), cout.tie(0); }
} __;

const int MOD = 998244353;

void chadd(ll &a, ll b) { a = (a + b) % MOD; }
int main() {
  int N;
  cin >> N;
  vector<string> S(N);
  rep(i, N) cin >> S[i];
  vector dp(N, vl(N));
  dp[0][0] = (S[0][0] == S[N - 1][N - 1]);
  rep(x, N - 1) {
    vector ndp(N, vl(N));
    rep(i, x + 1) {
      rep(j, x + 1) {
        rep(di, 2) {
          rep(dj, 2) {
            int i2 = i + di, j2 = j + dj;
            if (S[x + 1 - i2][i2] == S[N - 1 - j2][N - 1 - (x + 1 - j2)])
              chadd(ndp[i2][j2], dp[i][j]);
          }
        }
      }
    }
    dp = ndp;
  }
  ll ans = 0;
  rep(i, N) { chadd(ans, dp[i][i]); }
  cout << ans << '\n';
}