#include <bits/stdc++.h>
#define ull unsigned long long
#define pii pair <ull, ull>
#define fi first
#define se second

using namespace std;
const int N = 5005, mod = 998244353;
int n, lt[N]; 
string str;  

struct bit {
	ull c[79]; 
	friend bit operator & (const bit & a, const bit & b) {
		bit c; 
		for (int i = 0;i < 79;i++) c.c[i] = a.c[i]&b.c[i]; 
		return c; 
	}
	friend bit operator | (const bit & a, const bit & b) {
		bit c;
		for (int i = 0;i < 79;i++) c.c[i] = a.c[i]|b.c[i]; 
		return c; 
	}
	friend bool operator == (const bit & a, const bit & b) {
		for (int i = 0;i < 79;i++) if (a.c[i]^b.c[i]) return 0; 
		return 1; 
	}
	ull hsh () {
		ull res = 0; 
		for (int i = 0;i < 79;i++) res = res*127%mod+c[i]; 
		return res; 
	}
	void upd (int p) {
		c[p>>6] |= 1ull<<(p&63); 
	}
	bool none () {
		for (int i = 0;i < 79;i++) if (c[i]) return 0;
		return 1; 
	}
	int count () {
		int res = 0; 
		for (int i = 0;i < 79;i++) res += __builtin_popcountll(c[i]); 
		return res; 
	}
}c[N][2], emt;

map <int, bit > hs; 
map <pii, int> f, g; 

int main () {
	cin >> n; 
	lt[0] = 1; for (int i = 1;i < N;i++) lt[i] = lt[i-1]*2%mod; 
	for (int i = 0;i < n;i++) {
		cin >> str; 
		for (int j = 0;j < n;j++) c[i][str[j]-'0'].upd(j); 
	}
	hs[0] = emt; f[{0, 0}] = 1; 
	for (int i = 0;i < n;i++) {
		g.clear(); 
		for (auto j : f) {
			auto x = hs[j.fi.fi], y = hs[j.fi.se]; 
			auto nx = x|c[i][0], ny = y|c[i][1]; 
			if ((y&c[i][0]).none()) {
				ull nk = nx.hsh(); 
				if (hs.count(nk)) assert(hs[nk] == nx); 
				hs[nk] = nx; 
				(g[{nk, j.fi.se}] += j.se) %= mod; 
			}
			if ((x&c[i][1]).none()) {
				ull nk = ny.hsh(); 
				if (hs.count(nk)) assert(hs[nk] == ny); 
				hs[nk] = ny; 
				(g[{j.fi.fi, nk}] += j.se) %= mod; 
			}
		}
		swap(f, g);  
	}
	long long ans = 0; 
	for (auto j : f) {
		auto x = hs[j.fi.fi], y = hs[j.fi.se]; 
//		cout << x.count() << " " << y.count() << endl; 
		(ans += 1ll*lt[n-x.count()-y.count()]*j.se) %= mod; 
	}
	cout << ans; 
	return 0; 
}