/*
Things to notice:
1. do not calculate useless values
2. do not use similar names
 
Things to check:
1. submit the correct file
2. time (it is log^2 or log)
3. memory
4. prove your naive thoughts 
5. long long
6. corner case like n=0,1,inf or n=m
7. check if there is a mistake in the ds or other tools you use
8. fileio in some oi-contest

9. module on time 
10. the number of a same divisor in a math problem
11. multi-information and queries for dp and ds problems
*/
#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pii pair<int,int>
#define mp make_pair
#define pb push_back
const int mod=998244353;
const int inf=0x3f3f3f3f;
int n,a[1005][1005];
void swpr(int u,int v)
{
	for(int i=1;i<=n;i++) swap(a[u][i],a[v][i]);
}
void swpc(int u,int v)
{
	for(int i=1;i<=n;i++) swap(a[i][u],a[i][v]);
}
int f[1005][1<<6][1<<6][5];
int dp[1005][1<<6][5];
int perm[11],Ans[11];
void bf()
{
	for(int i=1;i<=n;i++) perm[i]=i;
	do
	{
		int s=0;
		for(int i=1;i<=n;i++) s=(s+a[i][perm[i]])%5;
		Ans[s]=1;
	}while(next_permutation(perm+1,perm+1+n));
	for(int i=0;i<5;i++) cout<<(Ans[i]?"Y":"N");
	cout<<"\n";
}
void solve()
{
	cin>>n;
	for(int i=1;i<=n;i++) for(int j=1;j<=n;j++) cin>>a[i][j];
	if(n<=10) 
	{
		bf();
		return;
	}
	int sft=0,K=0;
	for(int i=1;i<=n;i+=2)
	{
		if(i>=9)
		{
			cout<<"YYYYY\n";
			return;
		}
		for(int j=i;j<=n;j++)
		{
			sft-=a[j][i];
			for(int l=1;l<=n;l++) if(l!=i) a[j][l]-=a[j][i],a[j][l]+=5,a[j][l]%=5;
			a[j][i]=0;
		}
		int fnd=0;
		for(int j=i+1;j<=n;j++)
		{
			int ok=-1;
			for(int l=i;l<=n;l++) if(a[j][l]!=a[i][l]) ok=l;
			if(ok!=-1)
			{
				fnd=1;
				swpr(i+1,j);
				swpc(i+1,ok);
				break;
			}
		}
		if(!fnd) break; 
		K+=2;
	}
	if(K>=8)
	{
		cout<<"YYYYY\n";
		return;
	}
	for(int j=K+1;j<=n;j++) sft-=a[K+1][j];
	for(int i=1;i<=K;i++) 
	{
		for(int j=K+1;j<=n;j++) a[i][j]=(a[i][j]-a[K+1][j]+5)%5;
	}
	f[0][0][0][0]=1;
	for(int i=0;i<n;i++) for(int m1=0;m1<(1<<K);m1++) for(int m2=0;m2<(1<<K);m2++) for(int s=0;s<5;s++) if(f[i][m1][m2][s])
	{
		f[i+1][m1][m2][s]=1;
		for(int j=0;j<K;j++) if(!(m1&(1<<j)))
		{
			int s2=(s+a[j+1][i+1])%5;
			int mm1=(m1|(1<<j));
			int mm2=m2;
			if(i<K) mm2|=(1<<i);
			f[i+1][mm1][mm2][s2]=1;
		}
	}
	for(int m2=0;m2<(1<<K);m2++) for(int s=0;s<5;s++) if(f[n][(1<<K)-1][m2][s]) dp[K][m2][s]=1;//,cerr<<m2<<" "<<s<<"\n";
	for(int i=K;i<n;i++) for(int m1=0;m1<(1<<K);m1++) for(int s=0;s<5;s++) if(dp[i][m1][s])
	{
		dp[i+1][m1][s]=1;
		for(int j=0;j<K;j++) if(!(m1&(1<<j)))
		{
			int s2=(s+a[i+1][j+1])%5;
			int mm1=(m1|(1<<j));
			dp[i+1][mm1][s2]=1;
		}
	}
	for(int s=0;s<5;s++)
	{
		int rs=(s+sft%5+5)%5;
		if(dp[n][(1<<K)-1][rs]) cout<<"Y";
		else cout<<"N";
	}
	cout<<"\n";
}
signed main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	int _=1;
//	cin>>_;
	while(_--) solve();
	return 0;
}