#include <bits/stdc++.h>
#define ull unsigned long long
using namespace std;
const int N = 5005;
const int mod = 998244353;

inline int add(int x, int y) {x += y; return x >= mod ? x - mod : x;}
inline void Add(int &x, int y) {x = add(x, y);}

int n, C[N][N], num[N], sz[N], pd[N], ans, pw[N];
bitset<N> pre[N], suf[N], a[N];

int main() {
	scanf("%d", &n);
	pw[0] = 1;
	for (int i = 1; i <= n; ++i) suf[n][i] = 1;
	for (int i = 1; i <= n; ++i) pw[i] = add(pw[i - 1], pw[i - 1]);
	for (int i = 0; i <= n; ++i) {
		C[i][0] = C[i][i] = 1;
		for (int j = 1; j < i; ++j) C[i][j] = add(C[i - 1][j - 1], C[i - 1][j]);
	}
	for (int i = 1; i <= n; ++i) {
		for (int j = 1; j <= n; ++j) {
			char ch; cin >> ch;
			a[i][j] = ch - '0';
		}
		num[i] = a[i].count();
		pd[num[i]] = i;
		sz[num[i]]++;
	}
	for (int i = 0; i <= n; ++i) {
		if (i) pre[i] = pre[i - 1];
		for (int j = 1; j <= n; ++j) {
			if (num[j] != i) continue;
			pre[i] |= a[j];
		}
	}
	for (int i = n; i >= 0; --i) {
		if (i < n) suf[i] = suf[i + 1];
		for (int j = 1; j <= n; ++j) {
			if (num[j] != i) continue;
			suf[i] &= a[j];
		}
	}
	for (int i = 0; i <= n; ++i) {
		if ((pre[i] | suf[i]) != suf[i]) continue;
		int p = suf[i].count() - pre[i].count();
		int q = i - pre[i].count();
		if (p >= 0 && q >= 0 && p >= q) Add(ans, C[p][q]);
		Add(ans, pw[sz[i]]);
		Add(ans, mod - 1);
//		printf("%d %d %d %d\n", i, sz[i], p, q);
	}
	printf("%d\n", ans); return 0;
}