#include <iostream>
#include <bitset>
#include <vector>

const int N = 5e3 + 5;
const int P = 998244353;

int n;
std::bitset<N> a[N];
std::bitset<N> pre[N], suf[N];
std::vector<int> adj[N];
int pw[N], fac[N], ifac[N];

int qpow(int x, int p) {
	int res = 1, base = x;
	while(p) {
		if(p & 1) res = 1ll * res * base % P;
		base = 1ll * base * base % P;
		p >>= 1;
	}
	return res;
}

inline int cob(int n, int m) {
	return 1ll * fac[n] * ifac[m] % P * ifac[n-m] % P;
}

int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr), std::cout.tie(nullptr);

	std::cin >> n;
	for(int i = 1; i <= n; ++i) {
		int sum = 0;
		for(int j = 1; j <= n; ++j) {
			char ch; std::cin >> ch;
			a[i][j] = ch == '1';
			sum += a[i][j];
		}
		adj[sum].push_back(i);
	}
	pw[0] = 1;
	for(int i = 1; i <= n; ++i) pw[i] = 2 * pw[i-1] % P;
	fac[0] = fac[1] = ifac[0] = ifac[1] = 1;
	for(int i = 2; i <= n; ++i) fac[i] = 1ll * fac[i-1] * i % P;
	ifac[n] = qpow(fac[n], P - 2);
	for(int i = n - 1; i >= 2; --i) ifac[i] = 1ll * ifac[i+1] * (i+1) % P;

	for(int i = 0; i <= n; ++i) {
		if(i) pre[i] = pre[i-1];
		for(int j : adj[i]) pre[i] |= a[j];
	}
	for(int i = 1; i <= n; ++i) suf[n+1][i] = 1;
	for(int i = n; i >= 0; --i) {
		suf[i] = suf[i+1];
		for(int j : adj[i]) suf[i] &= a[j];
	}
	int ans = 0;
	for(int i = 0; i <= n; ++i) {
		std::bitset<N> lower, upper;
		if(i) lower = pre[i-1];
		upper = suf[i+1];
		if((lower & upper) != lower) continue;
		if(!adj[i].empty()) {
			std::bitset<N> current = a[adj[i][0]];
			if((lower & current) != lower) continue;
			if((current & upper) != current) continue;
			bool ok = 1;
			for(int j : adj[i]) if(a[j] != current) {
				ok = 0;
				break;
			}
			if(ok) {
				ans = (ans + pw[adj[i].size()]) % P;
			}
		} else {
			int l = lower.count(), r = upper.count();
			if(l <= i && i <= r) ans = (ans + cob(r - l, i - l)) % P;
		}
	}
	std::cout << ans << "\n";

	return 0;
}