#include<bits/stdc++.h>
using namespace std;
const int p=5;
int n,a[1005][1005],b[1005][1005],u[1005],v[1005];
int xp[1005],yp[1005];
int f[1005][1<<10],py[1<<p][p];
int main(){
	scanf("%d",&n);
	for(int i=1;i<=n;++i)for(int j=1;j<=n;++j){
		scanf("%d",&a[i][j]);b[i][j]=a[i][j];
	}
	for(int i=1;i<=n;++i)xp[i]=yp[i]=i;
	int T=min(n/2,p),L=1;
	while(T--){
		for(int i=1;i<=n;++i)for(int j=1;j<=n;++j){
			a[i][j]=b[xp[i]][yp[j]];
		}
		int R=n,x=0,y=0,xx=0,yy=0;
		for(int i=L;i<=L;++i)for(int j=L;j<=L;++j){
			for(int ii=i+1;ii<=R;++ii)for(int jj=j+1;jj<=R;++jj){
				if((a[i][j]+a[ii][jj]-a[i][jj]-a[ii][j])%p){
					x=i;y=j;xx=ii;yy=jj;
				}
			}
		}
		if(!x)break;
		while(x>L)swap(xp[x],xp[x-1]),--x;
		while(xx>L)swap(xp[xx],xp[xx-1]),--xx;
		while(y>L)swap(yp[y],yp[y-1]),--y;
		while(yy>L)swap(yp[yy],yp[yy-1]),--yy;
		L+=2;
	}
	if(L==2*p+1){
		puts("YYYYY");
		return 0;
	}
	for(int i=0;i<(1<<p);++i)for(int j=0;j<p;++j){
		int S=0;
		for(int k=0;k<p;++k)if(i>>k&1)S|=1<<((j+k)%p);
		py[i][j]=S;
	}
	int h=0;
	for(int i=L;i<=n;++i)h=(h+a[i][i])%p;
	int k=L-1;
	for(int i=k+1;i<=n;++i)u[i]=a[i][k+1]%p;
	for(int i=k+1;i<=n;++i)v[i]=(a[k+1][i]-a[k+1][k+1]%p+p)%p;
	f[0][0]=1;
	for(int i=1;i<=k;++i)for(int S=0;S<(1<<k);++S)for(int j=1;j<=n;++j){
		if(j<=k&&(S>>(j-1)&1))continue;
		int SS=S|(j<=k?(1<<(j-1)):0),aa=(a[j][i]-(j<=k?0:u[j])+p)%p;
		f[i][SS]|=py[f[i-1][S]][aa];
	}
	for(int i=k+1;i<=n;++i)for(int S=0;S<(1<<k);++S){
		f[i][S]|=f[i-1][S];
		for(int j=1;j<=k;++j)if(!(S>>(j-1)&1)){
			int aa=(a[j][i]-v[i]+p)%p;
			f[i][S|(1<<(j-1))]|=py[f[i-1][S]][aa];
		}
	}
	int ans=py[f[n][(1<<k)-1]][h];
	for(int i=0;i<p;++i)putchar((ans>>i&1)?'Y':'N');
	return 0;
}