// Go in my style.
// Not afraid to dark.

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

#define inline __inline__ __attribute__ ((always_inline))

#define int long long

namespace io {
	int pos;
	inline int read (int &p = pos){
		static int v; static char c;
		p = 0, v = 1, c = getchar ();
		while (! isdigit (c)){
			if (c == '-') v = - 1;
			c = getchar ();
		}
		while (isdigit (c)){
			p = (p << 1) + (p << 3) + (c - 48);
			c = getchar ();
		}
		return p *= v;
	}
	inline int next_blank (){
		static char c; c = getchar ();
		while (! isdigit (c)) c = getchar ();
		return c - 48;
	}
	inline void write (int x){
		static int sta[65], top;
		if (x < 0) putchar ('-'), x = - x;
		top = 0;
		do {
			sta[++ top] = x % 10;
			x /= 10;
		} while (x);
		while (top) putchar (sta[top --] + 48);
	}
}

const int N = 5e3, mod = 998244353;
int n, fr[N + 5], fc[N + 5], maxr[N + 5], maxc[N + 5];
int ar[N + 5], ac[N + 5], br, bc;
int lasr[N + 5], lasc[N + 5];
int prer[N + 5], prec[N + 5];
int ans;

int inv[N + 5], inj[N + 5], jc[N + 5];
inline int C (int a, int b){
	return jc[a] * inj[b] % mod * inj[a - b] % mod;
}

signed main (){
	io::read (n);
	inv[1] = jc[0] = jc[1] = inj[0] = inj[1] = 1;
	for (int i = 2;i <= n;++ i){
		inv[i] = inv[i - mod % i] * (mod / i + 1) % mod;
		inj[i] = inj[i - 1] * inv[i] % mod;
		jc[i] = jc[i - 1] * i % mod;
	}
	for (int i = 1;i <= n;++ i)
		for (int j = 1;j <= n;++ j)
			if (io::next_blank ())
				++ ar[i], ++ ac[j];
			else
				++ br, ++ bc;
	sort (ar + 1, ar + n + 1, [] (const int &x, const int &y){ return x > y; });
	sort (ac + 1, ac + n + 1, [] (const int &x, const int &y){ return x > y; });
	lasr[n] = lasc[n] = n;
	for (int i = n - 1;i >= 1;-- i){
		if (ar[i] == ar[i + 1]) lasr[i] = lasr[i + 1];
		else lasr[i] = i;
		if (ac[i] == ac[i + 1]) lasc[i] = lasc[i + 1];
		else lasc[i] = i;
	}
	prer[1] = prec[1] = 1;
	for (int i = 2;i <= n;++ i){
		if (ar[i] == ar[i - 1]) prer[i] = prer[i - 1];
		else prer[i] = i;
		if (ac[i] == ac[i - 1]) prec[i] = prec[i - 1];
		else prec[i] = i;
	}
	for (int i = 0;i <= n;++ i){
		if (i) br += ar[i] - (n - ar[i]), bc += ac[i] - (n - ac[i]);
		fr[i] = C (lasr[i] - prer[i] + 1, i - prer[i] + 1);
		maxr[i] = br;
		fc[i] = C (lasc[i] - prec[i] + 1, i - prec[i] + 1);
		maxc[i] = bc;
	}
	for (int i = 0;i <= n;++ i)
		for (int j = 0;j <= n;++ j)
			if (maxr[i] + maxc[j] - i * j - (n - i) * (n - j) == n * n)
				ans = (ans + fr[i] * fc[j] % mod) % mod;
	io::write (ans), putchar ('\n');
	return 0;
}