#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")

////////////////////////////////////////////////////////////////////////////////
template <unsigned M_> struct ModInt {
  static constexpr unsigned M = M_;
  unsigned x;
  constexpr ModInt() : x(0U) {}
  constexpr ModInt(unsigned x_) : x(x_ % M) {}
  constexpr ModInt(unsigned long long x_) : x(x_ % M) {}
  constexpr ModInt(int x_) : x(((x_ %= static_cast<int>(M)) < 0) ? (x_ + static_cast<int>(M)) : x_) {}
  constexpr ModInt(long long x_) : x(((x_ %= static_cast<long long>(M)) < 0) ? (x_ + static_cast<long long>(M)) : x_) {}
  ModInt &operator+=(const ModInt &a) { x = ((x += a.x) >= M) ? (x - M) : x; return *this; }
  ModInt &operator-=(const ModInt &a) { x = ((x -= a.x) >= M) ? (x + M) : x; return *this; }
  ModInt &operator*=(const ModInt &a) { x = (static_cast<unsigned long long>(x) * a.x) % M; return *this; }
  ModInt &operator/=(const ModInt &a) { return (*this *= a.inv()); }
  ModInt pow(long long e) const {
    if (e < 0) return inv().pow(-e);
    ModInt a = *this, b = 1U; for (; e; e >>= 1) { if (e & 1) b *= a; a *= a; } return b;
  }
  ModInt inv() const {
    unsigned a = M, b = x; int y = 0, z = 1;
    for (; b; ) { const unsigned q = a / b; const unsigned c = a - q * b; a = b; b = c; const int w = y - static_cast<int>(q) * z; y = z; z = w; }
    assert(a == 1U); return ModInt(y);
  }
  ModInt operator+() const { return *this; }
  ModInt operator-() const { ModInt a; a.x = x ? (M - x) : 0U; return a; }
  ModInt operator+(const ModInt &a) const { return (ModInt(*this) += a); }
  ModInt operator-(const ModInt &a) const { return (ModInt(*this) -= a); }
  ModInt operator*(const ModInt &a) const { return (ModInt(*this) *= a); }
  ModInt operator/(const ModInt &a) const { return (ModInt(*this) /= a); }
  template <class T> friend ModInt operator+(T a, const ModInt &b) { return (ModInt(a) += b); }
  template <class T> friend ModInt operator-(T a, const ModInt &b) { return (ModInt(a) -= b); }
  template <class T> friend ModInt operator*(T a, const ModInt &b) { return (ModInt(a) *= b); }
  template <class T> friend ModInt operator/(T a, const ModInt &b) { return (ModInt(a) /= b); }
  explicit operator bool() const { return x; }
  bool operator==(const ModInt &a) const { return (x == a.x); }
  bool operator!=(const ModInt &a) const { return (x != a.x); }
  friend std::ostream &operator<<(std::ostream &os, const ModInt &a) { return os << a.x; }
};
////////////////////////////////////////////////////////////////////////////////

constexpr unsigned MO = 998244353;
using Mint = ModInt<MO>;


int N;
char C[5010][5010];

int f[5010][5010];

int main() {
  for (; ~scanf("%d", &N); ) {
    for (int x = 0; x < N; ++x) {
      scanf("%s", C[x]);
    }
    
    vector<pair<int, int>> rows(N), cols(N);
    for (int x = 0; x < N; ++x) rows[x] = make_pair(0, x);
    for (int y = 0; y < N; ++y) cols[y] = make_pair(0, y);
    for (int x = 0; x < N; ++x) for (int y = 0; y < N; ++y) if (C[x][y] == '1') {
      ++rows[x].first;
      ++cols[y].first;
    }
    sort(rows.begin(), rows.end());
    sort(cols.begin(), cols.end());
    
    for (int x = 0; x < N; ++x) for (int y = 0; y < N; ++y) {
      f[x + 1][y + 1] = f[x + 1][y] + f[x][y + 1] - f[x][y] + (C[rows[x].second][cols[y].second] - '0');
    }
    
    vector<pair<int, int>> ps;
    for (int x = N; x >= 0; --x) for (int y = 0; y <= N; ++y) {
      if (f[x][y] == 0 && f[x][y] - f[x][N] - f[N][y] + f[N][N] == (N - x) * (N - y)) {
        ps.emplace_back(x, y);
      }
    }
// cerr<<"ps = "<<ps<<endl;
    const int psLen = ps.size();
    
    vector<Mint> two(N + 1);
    two[0] = 1;
    for (int i = 1; i <= N; ++i) two[i] = two[i - 1] * 2;
    Mint ans = psLen;
    for (int i = 0; i < psLen - 1; ) {
      if (ps[i].first == ps[i + 1].first) {
        int j = i;
        for (; j < psLen - 1 && ps[i].first == ps[j + 1].first; ++j) {}
// cerr<<"["<<i<<", "<<j<<"]"<<endl;
        ans += (two[j - i] - (j - i) - 1);
        i = j;
      } else if (ps[i].second == ps[i + 1].second) {
        int j = i;
        for (; j < psLen - 1 && ps[i].second == ps[j + 1].second; ++j) {}
// cerr<<"["<<i<<", "<<j<<"]"<<endl;
        ans += (two[j - i] - (j - i) - 1);
        i = j;
      } else {
        ++i;
      }
    }
    printf("%u\n", ans.x);
  }
  return 0;
}