/* Good Game, Well Play. */
#include <bits/stdc++.h>
#define lowbit(x) ((x) & (-(x)))
using namespace std;

const int N = 5010, mod = 998244353;
long long fac[N], inv[N];
inline long long C(int n, int m)
{return fac[n] * inv[m] % mod * inv[n - m] % mod;}
inline void exgcd(long long a, long long b, long long &x, long long &y)
{
	if(b == 0) {x = 1, y = 0; return ;}
	exgcd(b, a % b, y, x); y -= a / b * x;
}
inline long long Inv(long long num)
{
	long long x, y; exgcd(num, mod, x, y);
	x = (x % mod + mod) % mod; return x;
}
inline void init_math()
{
	fac[0] = inv[0] = 1;
	for(int i = 1; i <= 5000; ++i) fac[i] = fac[i - 1] * i % mod;
	inv[5000] = Inv(fac[5000]);
	for(int i = 4999; i >= 1; --i) inv[i] = inv[i + 1] * (i + 1) % mod;
}

int n, cnt_r[N], cnt_c[N], buc_r[N], buc_c[N], p_cnt_r[N], p_cnt_c[N]; long long res;
inline bool cmp(int x, int y) {return x > y;}

int main()
{
//	freopen("text.in", "r", stdin);
//	freopen("prog.out", "w", stdout);
	ios::sync_with_stdio(false);
	cin.tie(0), cout.tie(0);
	cin >> n; init_math();
	for(int i = 1; i <= n; ++i)
		for(int j = 1; j <= n; ++j)
			{char c; cin >> c; cnt_r[i] += (c - '0'), cnt_c[j] += (c - '0');}
	sort(cnt_r + 1, cnt_r + n + 1, cmp);
	sort(cnt_c + 1, cnt_c + n + 1, cmp);
	for(int i = 1; i <= n; ++i) p_cnt_r[i] = cnt_r[i] + p_cnt_r[i - 1], p_cnt_c[i] = cnt_c[i] + p_cnt_c[i - 1];
	for(int i = 1; i <= n; ++i) ++buc_r[cnt_r[i]];
	for(int i = 1; i <= n; ++i) ++buc_c[cnt_c[i]];
	for(int i = n - 1; i >= 0; --i) buc_r[i] += buc_r[i + 1], buc_c[i] += buc_c[i + 1];
	for(int n_r = 0; n_r <= n; ++n_r)
	{
		for(int n_c = 0; n_c <= n; ++n_c)
		{
			long long sum = 0, ways = 1;
			sum += p_cnt_r[n_r] + ((n - n_r) * n - (p_cnt_r[n] - p_cnt_r[n_r]));
			sum += p_cnt_c[n_c] + ((n - n_c) * n - (p_cnt_c[n] - p_cnt_c[n_c]));
			if(n_r) ways = ways * C(buc_r[cnt_r[n_r]] - buc_r[cnt_r[n_r] + 1], n_r - buc_r[cnt_r[n_r] + 1]);
			if(n_c) ways = ways * C(buc_c[cnt_c[n_c]] - buc_c[cnt_c[n_c] + 1], n_c - buc_c[cnt_c[n_c] + 1]);
			if(sum == 1ll * n * n + 1ll * n_r * n_c + 1ll * (n - n_r) * (n - n_c)) res = (res + ways) % mod;
		}
	}
	cout << res << '\n';
	return 0;
}
/*

*/