//Code by dXqwq, who is still searching painless suicide.
#include<bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
using namespace std;
// #define int long long
inline int read(){
   int s=0,w=1;
   char ch=getchar();
   while(ch<'0'||ch>'9'){if(ch=='-')w=-1;ch=getchar();}
   while(ch>='0'&&ch<='9') s=s*10+ch-'0',ch=getchar();
   return s*w;
}
const int p=5;
mt19937 rnd(20080520);
int a[1003][1003],t[1003][1003];
int b[1003],c[1003];
bool f[1003][5],ans[5];
signed main()
{
	int n=read();
	for(int i=1; i<=n; ++i)
		for(int j=1; j<=n; ++j)
			a[i][j]=read();
	for(int i=1; i<=n; ++i) b[i]=c[i]=i;
	for(int T=150; T--;)
	{
		shuffle(b+1,b+n+1,rnd);
		shuffle(c+1,c+n+1,rnd);
		for(int i=1; i<=n; ++i)
			for(int j=1; j<=n; ++j)
				t[b[i]][c[j]]=a[i][j];
		swap(a,t);
		memset(f,0,sizeof(f)),f[0][0]=1;
		for(int i=1; i<=n; ++i)
			for(int j=i,d=0; j<=n; ++j)
			{
				d+=a[j][i];
				for(int k=0; k<p; ++k)
					f[j][(k+d)%p]|=f[i-1][k];
				d-=a[j][i];
				d+=a[j][j+1];
			}
		for(int i=0; i<5; ++i)
			ans[i]|=f[n][i];
	}
	for(int i=0; i<5; ++i)
		if(ans[i]) putchar('Y');
		else putchar('N');
	return 0;
}