#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
#define op(x) ((x&1)?x+1:x-1)
#define odd(x) (x&1)
#define even(x) (!odd(x))
#define lc(x) (x<<1)
#define rc(x) (lc(x)|1)
#define lowbit(x) (x&-x)
#define mp(x,y) make_pair(x,y)
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
using namespace std;
const int MAXN = 510,mod = 998244353;
int n,a[MAXN][MAXN],cnt;

void solve(int r){
	if(r>n)return;
	int x = -1; rep(i,r,n)if(a[i][r]){x = i;break;}
	if(x == -1){
		cout<<"0\n";
		exit(0);
	}
	if(x != r){
		cnt ^= 1;
		rep(j,1,n)swap(a[r][j],a[x][j]);
	}
	rep(i,r+1,n){
		while(a[r][r] && a[i][r]){
			int v = a[r][r] / a[i][r];
			rep(j,1,n)a[r][j] = (a[r][j] - 1ll*v*a[i][j]%mod + mod)%mod;
			cnt ^= 1;
			rep(j,1,n)swap(a[r][j],a[i][j]);
		}
		if(!a[r][r]){
			cnt ^= 1;
			rep(j,1,n)swap(a[r][j],a[i][j]);
		}
	}
}

int main(){
	cin>>n;
	rep(i,1,n)rep(j,1,n)cin>>a[i][j];

	solve(1);

	int ans = cnt ? (mod-1) : (1);
	rep(i,1,n)ans = 1ll*ans*a[i][i]%mod;
	cout<<ans<<endl;

    return 0;
}