#include<bits/stdc++.h>
using namespace std;
mt19937 mt(random_device{}());
constexpr int M=1005;int n,ans,N;
int px[M],py[M],a[M][M],b[M][M],mrg[50][50];
int read(){
    int x=0;char ch=getchar();
    while (!isdigit(ch)) ch=getchar();
    while (isdigit(ch)) x=x*10+ch-48,ch=getchar();
    return x;
}
int merge(int a,int b){
    int ans=0;
    for (int i=0;i<5;i++)
        if (a>>i&1) ans|=b<<i;
    return (ans&31)|(ans>>5);
}
int query(int xl,int xr,int yl,int yr){\
    if (xl==xr&&yl==yr) return xl>n&&yl>n?1:xl>n||yl>n?0:1<<b[xl][yl];
    int midx=xl+xr>>1,midy=yl+yr>>1;
    return mrg[query(xl,midx,yl,midy)][query(midx+1,xr,midy+1,yr)]|
           mrg[query(xl,midx,midy+1,yr)][query(midx+1,xr,yl,midy)];
}
int main(){ n=read();
    for (int i=1;i<=n;i++)
        for (int j=1;j<=n;j++)
            a[i][j]=read();
    for (int i=0;i<32;i++)
        for (int j=0;j<32;j++)
            mrg[i][j]=merge(i,j);
    iota(px,px+n+1,0);
    iota(py,py+n+1,0);
    N=2<<__lg(n);
    do{
        shuffle(px+1,px+n+1,mt);
        shuffle(py+1,py+n+1,mt);
        for (int i=1;i<=n;i++)
            for (int j=1;j<=n;j++)
                b[px[i]][py[j]]=a[i][j];
        ans|=query(1,N,1,N);
    }while(clock()<CLOCKS_PER_SEC*0.99);
    for (int i=0;i<5;i++) putchar(ans>>i&1?'Y':'N');
    return 0;
}