#include <bits/stdc++.h>
using namespace std;
const int N = 500 + 10,P=998244353;
int n,a[N][N];
inline int qpow(int a,int b){int res = 1;while(b){if(b&1)res=1ll*res*a%P;a=1ll*a*a%P,b>>=1;}return res;}
int calc(){
    int res = 1;
    for(int i = 1; i <= n ; ++ i){
        int c = 0;
        for(int j = i ; j <= n ; ++ j){
            if(a[i][j]){c=j;break;}
        }
        if(!c){
            return 0;
        }
        if(c!=i)swap(a[i],a[c]),res = P-res;
        for(int j = i+1; j <= n ; ++ j){
            int dif = a[j][i] * qpow(a[i][i],P-2); 
            for(int k = i ; k <= n ; ++ k)a[j][k] = (a[j][k] - (1ll*a[i][k]*dif)%P + P)%P;
        }
    }
    for(int i = 1; i <= n ; ++ i)res = 1ll*res*a[i][i]%P;
    return res;
}
int main(){
    ios::sync_with_stdio(false),cin.tie(0);
    cin >> n;
    for(int i = 1; i <= n ; ++ i)
        for(int j = 1; j <= n ; ++ j)cin >> a[i][j];
    cout << calc() << "\n";
    return 0;
}