//A tree without skin will surely die.
//A man without face will be alive.
#include<bits/stdc++.h>
using namespace std;
#define rep(i,j,k) for (int i=j;i<=k;++i)
#define per(i,j,k) for (int i=j;i>=k;--i)
int const N=1e3+10;
int n,a[N][N],b[N][N],A[N],B[N],f[1<<8],g[1<<8],h[1<<8][1<<8];
inline int get(int x){return (x&31)|(x>>5);}
inline int merge(int s,int t){
	int res=0;
	rep(i,0,4) if (t>>i&1) res|=get(s<<i);
	return res;
}
inline void solve(){
	cin>>n;
	rep(i,1,n) rep(j,1,n) cin>>a[i][j];
	int p=0;
	while (p<5){
		int x=0,y=0;
		rep(i,1,n){
			if (!A[i]) x=i;
			if (!B[i]) y=i;
		}
		rep(i,1,n) if (!A[i] && x!=i){
			rep(j,1,n) if (!B[j] && y!=j){
				if ((a[x][y]+a[i][j])%5!=(a[x][j]+a[i][y])%5){
					A[i]=B[j]=2*p+1,A[x]=B[y]=2*p+2;
					goto down;
				}
			}
		}
		break;
		down:++p;
	}
	if (p==5) return cout<<"YYYYY\n",void();
	int xx=2*p,yy=2*p;
	rep(i,1,n){
		if (!A[i]) A[i]=++xx;
		if (!B[i]) B[i]=++yy;
	}
	rep(i,1,n) rep(j,1,n) b[A[i]-1][B[j]-1]=a[i][j];
	memcpy(a,b,sizeof(a));
	int tot=0;
	rep(i,2*p,n-1){
		int add=(5-a[i][2*p])%5;
		tot+=a[i][2*p];
		rep(j,0,n-1) a[i][j]=(a[i][j]+add)%5;
	}
	rep(j,2*p,n-1){
		int add=(5-a[2*p][j])%5;
		tot+=a[2*p][j];
		rep(i,0,n-1) a[i][j]=(a[i][j]+add)%5;
	}
	int ans=0,U=(1<<(2*p));
	f[0]=g[0]=h[0][0]=1;
	//f[S] -> 占据行集合 S
	//g[S] -> 占据列集合 S
	rep(i,2*p,n-1) per(S,U-1,0) rep(j,0,2*p-1)
		if (!(S>>j&1)){
			f[S|(1<<j)]|=get(f[S]<<a[j][i]);
			g[S|(1<<j)]|=get(g[S]<<a[i][j]);
		}
	tot%=5;
	rep(S,0,U-1) rep(T,0,U-1)
		if (h[S][T]){
			ans|=merge(h[S][T],merge(f[U-1-S],g[U-1-T]));
			rep(i,0,2*p-1) if (!(S>>i&1)){
				rep(j,0,2*p-1) if (!(T>>j&1))
					h[S|(1<<i)][T|(1<<j)]|=get(h[S][T]<<a[i][j]);
			}
		}
	ans=get(ans<<tot);
	rep(i,0,4)
		if (ans>>i&1) cout<<'Y';
		else cout<<'N';
	cout<<'\n';
}
signed main(){
	ios::sync_with_stdio(false);
	cin.tie(0),cout.tie(0);
	int t=1;
	// cin>>t;
	while (t--) solve();
	return 0;
}