#include<bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=(a);i<=(b);++i) 
#define dec(i,a,b) for(int i=(a);i>=(b);--i) 
using ll=long long;
using pi=pair<int,int>;
using vi=vector<int>;
using vp=vector<pi>;
template<class T> bool chkmin(T &x,T y) {return (y<x)?(x=y,true):false;}
template<class T> bool chkmax(T &x,T y) {return (y>x)?(x=y,true):false;}
#define pb push_back
#define SZ(x) int(x.size())
#define fi first
#define se second
#define LOCAL 0
#define open_file if(LOCAL) {freopen("a.in","r",stdin);freopen("a.out","w",stdout);}
int read() {int x;scanf("%d",&x);return x;}

const int MAXN=1005;
int n;
int base=0;
vi a[MAXN];
bool check_same(int i,int j,int st) {
    rep(k,st,n) if((a[i][st]+a[j][k]-a[i][k]-a[j][st])%5!=0) return false;
    return true;
}
void swap_line(int i,int j) {
    swap(a[i],a[j]);
}
void swap_colm(int i,int j) {
    rep(k,1,n) swap(a[k][i],a[k][j]);
}
void add_line(int i,int delt) {
    rep(j,1,n) (a[i][j]+=delt)%=5;
    (base+=5+delt)%=5;
}
void add_colm(int j,int delt) {
    rep(i,1,n) (a[i][j]+=delt)%=5;
    (base+=5+delt)%=5;
}

int dfs(int I) {//to matrix::[I,n]
    if(I>=n||I>=10) return I/2;
    bool ok=false;
    rep(i,I+1,n) if(!check_same(I,i,I)) {
        swap_line(i,I+1);ok=true;break;
    }
    if(!ok) return I/2;//end!
    int k=I+1;
    while(k<=n&&(a[I][I]+a[I+1][k]-a[I][k]-a[I+1][I])%5==0) k++;
    assert(k<=n);//!
    swap_colm(k,I+1);
    return dfs(I+2);
}

bool mrk[10];
int match[10];
int k;

#define Bit(i) (1<<(i))
#define bit(s,i) (((s)>>(i))&1)

using info=vector<bool>;
info operator <<(const info &x,int delt) {
    info y(5);
    rep(i,0,4) y[(i+delt+5)%5]=x[i];
    return y;
}
void operator |=(info &x,const info &y) {rep(i,0,4) if(y[i]) x[i]=true;}
info operator *(const info &x,const info &y) {
    info w(5);
    rep(i,0,4) if(x[i]) w|=y<<i;
    return w;
}
void operator *=(info &x,const info &y) {x=x*y;}
info answer;
info X[Bit(8)],Y[Bit(8)];

void prework() {
    rep(s,0,Bit(2*k)-1) {
        X[s].resize(5);
        // X[s][0]=true;
    }
    X[0][0]=true;
    rep(p,2*k+1,n) {
        // rep(s,0,Bit(2*k)-1) rep(i,1,2*k) if(!bit(s,i)) X[s|]
        dec(s,Bit(2*k)-1,0) rep(i,1,2*k) if(!bit(s,i-1)) X[s|Bit(i-1)]|=X[s]<<a[p][i];
    }
    rep(s,0,Bit(2*k)-1) {
        Y[s].resize(5);
        // Y[s][0]=true;
    }
    Y[0][0]=true;
    rep(p,2*k+1,n) {
        dec(s,Bit(2*k)-1,0) rep(i,1,2*k) if(!bit(s,i-1)) Y[s|Bit(i-1)]|=Y[s]<<a[i][p];
    }
}

void work() { // [][][][][][][]

    // rep(i,1,2*k) printf("%d ",match[i]);puts("");

    int rex=Bit(2*k)-1,rey=rex,d=0;//
    rep(i,1,2*k) if(match[i]) {
        // rex^=Bit(i-1);
        // rey^=Bit(match[i]-1); //!!
        rex^=Bit(match[i]-1);
        rey^=Bit(i-1);
        d+=a[i][match[i]];
    }    
    d%=5;
    auto ret=(X[rex]*Y[rey])<<d;
    answer|=ret;
    // rep(i,0,4) printf("%d",int(ret[i]));puts("");
    // rep(i,0,4) printf("%d",int(X[rex][i]));puts("");
    // rep(i,0,4) printf("%d",int(Y[rey][i]));puts("");
}

void bf(int cur) {
    if(cur==2*k+1) return work();
    rep(i,0,2*k) if(!mrk[i]) {
        match[cur]=i;
        if(i) mrk[i]=true;
        bf(cur+1);
        mrk[i]=false;
    }
}

void solve() {
    n=read();
    rep(i,1,n) {
        a[i].resize(n+1);
        rep(j,1,n) a[i][j]=read();
    }
    k=dfs(1);
    if(k>=5) {puts("YYYYY");return ;}
    rep(i,2*k+1,n) assert(check_same(i,2*k+1,2*k+1));
    rep(i,2*k+1,n) {
        int delt=a[2*k+1][n]-a[i][n];
        delt=(delt+5)%5;
        add_line(i,delt);
    }
    
    rep(j,2*k+1,n) {
        int nw=a[n][j];
        nw=(5-nw)%5;
        add_colm(j,nw);
    }
    // cerr<<base<<","<<k<<"\n";
    rep(i,2*k+1,n) rep(j,2*k+1,n) assert(a[i][j]==0);//
    // rep(i,1,n) {
    //     rep(j,1,n) printf("%d ",a[i][j]);
    //     puts("");
    // }

    

    answer.resize(5);

    //[1,2k] 
    prework();
    bf(1);
    rep(y,0,4) {
        bool ok=answer[(y+base+5)%5];
        printf("%c",ok?'Y':'N');
    }
}
int main() {
    open_file
    solve();
    return 0;
}