#include<bits/stdc++.h>
#define int long long
using namespace std;
#define fi first
#define sc second
#define pii pair<int,int>
#define pb push_back
#define umap unordered_map
#define mset multiset
#define pq priority_queue
#define ull unsigned long long
#define i128 __int128
const int maxn=100+10;
const int mod=998244353;
int n,res,a[maxn][maxn];
int quickpow(int x,int y){
    int p=1;
    for(int i=y;i;i>>=1) p=(p*((i&1)?x:1))%mod,x=(x*x)%mod;
    return p;
}
int inv(int x){
    return quickpow(x,mod-2);
}
void solve(){
    cin>>n,res=1;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++) cin>>a[i][j];
    }
    for(int i=1;i<=n;i++){
        for(int j=i+1;j<=n;j++){
            if(a[j][i]){
                swap(a[j],a[i]),res*=-1;
                break;
            }
        }
        if(!a[i][i]) return cout<<0<<endl,void();
        res=(res*a[i][i])%mod;
        for(int j=i+1;j<=n;j++){
            if(a[j][i]){
                int val=inv(a[i][i])*a[j][i]%mod;
                for(int k=i;k<=n;k++) a[j][k]=(a[j][k]-a[i][k]*val%mod+mod)%mod;
            }
        }
    }
    cout<<(res+mod)%mod<<endl;
}
signed main(){
    ios::sync_with_stdio(false);
    cin.tie(0),cout.tie(0);
    int t=1;
    // cin>>t;
    while(t--) solve();
    return 0;
}
/*
Samples
input:

output:

THINGS TODO:
检查freopen，尤其是后缀名
检查空间
检查调试语句是否全部注释
*/