#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;


#define ForBit(i,x) for(ull i=0,n=x;(1ull<<i)<=n && i < 64;++i) if(n>>i&1)
ull s[64][64]; 
int vis[64][64];
inline ull f(ull x,ull y);
inline ull g(int x,int y){
	if(!x||!y) return 1ull<<(x|y); 
    if(vis[x][y]) return s[x][y];
    // printf("calcg %d %d\n",x,y);
	ull t=1; int upd=x^y; 
    ForBit(i,upd) t<<=(1ull<<i);
	upd=x&y; 
    ForBit(i,upd) t=f(t,3ull<<((1<<i)-1));
    vis[x][y] = vis[y][x] = 1;
	return s[x][y]=s[y][x]=t;
}
inline ull f(ull x,ull y){
	if(!x||!y) return 0; if(x==1||y==1) return max(x,y);
	ull t=0; ForBit(i,x) ForBit(j,y) t^=g(i,j); return t;
}
ull inv(ull x) {
    // printf("INV %lu\n",x) ;
    ull s = -2;
    ull ans = 1;
    while(s) {
        if(s & 1) ans = f(ans , x);
        x = f(x , x);s >>= 1;
    }
    return ans;
}
ull a[155][155];
int n;
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];
    for(int i = 1;i <= n;i++) {
        int ff = -1;
        for(int j = i;j <= n;j++) {
            if(a[j][i]) {ff = j ; break ;}
        }
        if(ff == -1) {
            cout << "Second\n" ; return 0;
        }
        for(int j = i;j <= n;j++) swap(a[ff][j] , a[i][j]);
        // puts("OK") ;
        ull Inv = inv(a[i][i]) ;
        // printf("%lu : inv %lu , mul %lu %lu\n",a[i][i] , Inv , f(Inv , a[i][i]) , f(a[i][i] , Inv)) ;
        for(int j = i + 1;j <= n;j++) {
            ull s = f(Inv , a[j][i]) ;
            ull Mul[64] = {0};
            for(int k = 0;k < 64;k++) {
                // Mul[k] = f((1ull << k) , s) ;
                ForBit(l , s) Mul[k] ^= g(k , l);
                // printf("D %lu %lu\n",Mul[k] , f((1ull << k) , s)) ;
            }
            for(int k = i; k <= n;k++) {
                /// a[j][k] += a[i][k] * (-a[j][i] / a[i][i])
                ull d = 0;
                ForBit(l , a[i][k]) d ^= Mul[l] ;
                // printf("D %lu , %lu\n",d,f(a[i][k] , s)) ;
                a[j][k] ^= d;
            }
            // printf("ok %d\n",j) ;
        }
        // for(int i = 1;i <= n;i++ , printf("\n")) for(int j = 1;j <= n;j++) printf("%lu ",a[i][j]) ;
    }
    ull d = 1;
    for(int i = 1;i <= n;i++) d = f(d , a[i][i]);
    if(d) cout << "First\n" ;
    else cout << "Second\n";
}
/*#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;


#define ForBit(i,x) for(ull i=0,n=x;(1ull<<i)<=n && i < 64;++i) if(n>>i&1)
ull s[64][64]; 
int vis[64][64];
inline ull f(ull x,ull y);
inline ull g(int x,int y){
	if(!x||!y) return 1ull<<(x|y); 
    if(vis[x][y]) return s[x][y];
    // printf("calcg %d %d\n",x,y);
	ull t=1; int upd=x^y; 
    ForBit(i,upd) t<<=(1ull<<i);
	upd=x&y; 
    ForBit(i,upd) t=f(t,3ull<<((1<<i)-1));
    vis[x][y] = vis[y][x] = 1;
	return s[x][y]=s[y][x]=t;
}
inline ull f(ull x,ull y){
	if(!x||!y) return 0; if(x==1||y==1) return max(x,y);
	ull t=0; ForBit(i,x) ForBit(j,y) t^=g(i,j); return t;
}
ull inv(ull x) {
    // printf("INV %lu\n",x) ;
    ull s = -2;
    ull ans = 1;
    while(s) {
        if(s & 1) ans = f(ans , x);
        x = f(x , x);s >>= 1;
    }
    return ans;
}
ull a[155][155];
int n;
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];
    for(int i = 1;i <= n;i++) {
        int ff = -1;
        for(int j = i;j <= n;j++) {
            if(a[j][i]) {ff = j ; break ;}
        }
        if(ff == -1) {
            cout << "Second\n" ; return 0;
        }
        for(int j = i;j <= n;j++) swap(a[ff][j] , a[i][j]);
        // puts("OK") ;
        ull Inv = inv(a[i][i]) ;
        // printf("%lu : inv %lu , mul %lu %lu\n",a[i][i] , Inv , f(Inv , a[i][i]) , f(a[i][i] , Inv)) ;
        for(int j = i + 1;j <= n;j++) {
            ull s = f(Inv , a[j][i]) ;
            ull Mul[64] = {0};
            for(int k = 0;k < 64;k++) {
                // Mul[k] = f((1ull << k) , s) ;
                ForBit(l , s) Mul[k] ^= g(k , l);
                // printf("D %lu %lu\n",Mul[k] , f((1ull << k) , s)) ;
            }
            for(int k = i; k <= n;k++) {
                /// a[j][k] += a[i][k] * (-a[j][i] / a[i][i])
                ull d = 0;
                ForBit(l , a[i][k]) d ^= Mul[l] ;
                // printf("D %lu , %lu\n",d,f(a[i][k] , s)) ;
                a[j][k] ^= d;
            }
            // printf("ok %d\n",j) ;
        }
        // for(int i = 1;i <= n;i++ , printf("\n")) for(int j = 1;j <= n;j++) printf("%lu ",a[i][j]) ;
    }
    ull d = 1;
    for(int i = 1;i <= n;i++) d = f(d , a[i][i]);
    if(d) cout << "First\n" ;
    else cout << "Second\n";
}#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;


#define ForBit(i,x) for(ull i=0,n=x;(1ull<<i)<=n && i < 64;++i) if(n>>i&1)
ull s[64][64]; 
int vis[64][64];
inline ull f(ull x,ull y);
inline ull g(int x,int y){
	if(!x||!y) return 1ull<<(x|y); 
    if(vis[x][y]) return s[x][y];
    // printf("calcg %d %d\n",x,y);
	ull t=1; int upd=x^y; 
    ForBit(i,upd) t<<=(1ull<<i);
	upd=x&y; 
    ForBit(i,upd) t=f(t,3ull<<((1<<i)-1));
    vis[x][y] = vis[y][x] = 1;
	return s[x][y]=s[y][x]=t;
}
inline ull f(ull x,ull y){
	if(!x||!y) return 0; if(x==1||y==1) return max(x,y);
	ull t=0; ForBit(i,x) ForBit(j,y) t^=g(i,j); return t;
}
ull inv(ull x) {
    // printf("INV %lu\n",x) ;
    ull s = -2;
    ull ans = 1;
    while(s) {
        if(s & 1) ans = f(ans , x);
        x = f(x , x);s >>= 1;
    }
    return ans;
}
ull a[155][155];
int n;
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];
    for(int i = 1;i <= n;i++) {
        int ff = -1;
        for(int j = i;j <= n;j++) {
            if(a[j][i]) {ff = j ; break ;}
        }
        if(ff == -1) {
            cout << "Second\n" ; return 0;
        }
        for(int j = i;j <= n;j++) swap(a[ff][j] , a[i][j]);
        // puts("OK") ;
        ull Inv = inv(a[i][i]) ;
        // printf("%lu : inv %lu , mul %lu %lu\n",a[i][i] , Inv , f(Inv , a[i][i]) , f(a[i][i] , Inv)) ;
        for(int j = i + 1;j <= n;j++) {
            ull s = f(Inv , a[j][i]) ;
            ull Mul[64] = {0};
            for(int k = 0;k < 64;k++) {
                // Mul[k] = f((1ull << k) , s) ;
                ForBit(l , s) Mul[k] ^= g(k , l);
                // printf("D %lu %lu\n",Mul[k] , f((1ull << k) , s)) ;
            }
            for(int k = i; k <= n;k++) {
                /// a[j][k] += a[i][k] * (-a[j][i] / a[i][i])
                ull d = 0;
                ForBit(l , a[i][k]) d ^= Mul[l] ;
                // printf("D %lu , %lu\n",d,f(a[i][k] , s)) ;
                a[j][k] ^= d;
            }
            // printf("ok %d\n",j) ;
        }
        // for(int i = 1;i <= n;i++ , printf("\n")) for(int j = 1;j <= n;j++) printf("%lu ",a[i][j]) ;
    }
    ull d = 1;
    for(int i = 1;i <= n;i++) d = f(d , a[i][i]);
    if(d) cout << "First\n" ;
    else cout << "Second\n";
}*/