#include <bits/stdc++.h>
#define int long long
using namespace std;

const int N = 5005 , mod = 998244353;

int c[N][N] , a[N] , b[N] , inv[N] , p[N] , q[N] , ans;
int sa[N][2] , sb[N][2] , fac[N] , n , f[N] , g[N];

int C (int n , int m) {
	return fac[n] * inv[m] % mod * inv[n - m] % mod;
}

int qpow (int a , int n) {
	int res = 1; for (;n;n >>= 1) {
		if (n & 1) res = a * res % mod;
		a = a * a % mod;
	} return res;
}

signed main() {
	cin >> n; for (int i = 1;i <= n;i ++)
		for (int j = 1;j <= n;j ++) {
			char x; cin >> x; 
			if (x - '0') a[i] ++ , b[j] ++;
		} fac[0] = inv[0] = 1;
	sort (a + 1 , a + 1 + n); sort (b + 1 , b + 1 + n);
	for (int i = 1;i <= n;i ++) 
		fac[i] = fac[i - 1] * i % mod,
		inv[i] = qpow (fac[i] , mod - 2);
	for (int i = 1;i <= n;i ++)
		sa[i][0] = sa[i - 1][0] + n - a[i],
		sb[i][0] = sb[i - 1][0] + n - b[i];
	for (int i = n;i >= 1;i --)
		sa[i][1] = sa[i + 1][1] + a[i],
		sb[i][1] = sb[i + 1][1] + b[i];
	for (int i = n;i >= 1;i --) {
		f[a[i]] ++; g[b[i]] ++;
		if (a[i] == a[i + 1]) p[i] = p[i + 1] + 1;
		else p[i] = 1;
		if (b[i] == b[i + 1]) q[i] = q[i + 1] + 1;
		else q[i] = 1;
	}
	for (int i = 0;i <= n;i ++) for (int j = 0;j <= n;j ++) {
		int val = i * j + (n - i) * (n - j) + n * n;
		if (sa[n - i + 1][1] + sa[n - i][0] + sb[n - j + 1][1] + sb[n - j][0] == val) 
			ans = (ans + C (f[a[n - i + 1]] , p[n - i + 1]) * C (g[b[n - j + 1]] , q[n - j + 1]) % mod) % mod;
	} cout << ans;
	return 0;
}