#include <bits/stdc++.h>
#define ll int
#define Ma 1000005
#define PLL pair<ll,ll>
#define IOS ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define N 1005
#define all(x) x.begin(),x.end()
#define pb push_back
#define M 5
using namespace std;

ll a[N][N];
ll n;
ll mod=5;
ll f[5];




void go(ll w,vector <ll> choose,vector <ll> b)
{
	/*printf("w=%d\n",w);
	printf("choose=\n");
	for (auto z:choose)
		printf("%d ",z);
	printf("\n");
	printf("b=\n");
	for (ll i=0;i<n;i++)
	{
		for (ll j=0;j<n;j++)
			printf("%d ",b[i*n+j]);
		printf("\n");
	}*/
	
	for (ll i=0;i<n;i++)
		for (ll j=i+1;j<n;j++)
		{
			ll add=(b[i*n+j]+b[j*n+i])%mod;
			if (!f[(add+w)%mod])
			{
				f[(add+w)%mod]=1;
				vector <ll> ne=choose;
				swap(ne[i],ne[j]);
				vector <ll> b2;
				for (ll x=0;x<n;x++)
					for (ll y=0;y<n;y++)
						b2.pb((a[ne[x]][y]-a[ne[x]][x]+mod)%mod);
				go((add+w)%mod,ne,b2);
			}
			
		}
}

void sol(){
	cin>>n;
	ll res=0;
	for (ll i=0;i<n;i++)
		for (ll j=0;j<n;j++)
			cin>>a[i][j];
	vector <ll> choose;
	vector <ll> b;
	for (ll i=0;i<n;i++)
	{
		res=(res+a[i][i])%mod;
		choose.pb(i);
		for (ll j=0;j<n;j++) b.pb((a[i][j]-a[i][i]+mod)%mod);
	}
	f[res]=1;
	go(res,choose,b);
	for (ll i=0;i<5;i++)
		if (f[i])
			printf("Y");
		else
			printf("N");
	printf("\n");
}


int main()
{
	ll tt=1;
	//cin>>tt;
	while (tt--)
		sol();
	return 0;
}