#include<bits/stdc++.h>
#ifdef xay5421
#define D(...) fprintf(stderr,__VA_ARGS__)
#define DD(...) D(#__VA_ARGS__ "="),debug_helper::debug(__VA_ARGS__),D("\n")
#include"/home/xay5421/debug.hpp"
#else
#define D(...) ((void)0)
#define DD(...) ((void)0)
#endif
#define pb push_back
#define eb emplace_back
#define SZ(x) ((int)(x).size())
#define each(x,v) for(auto&x:v)
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
#define per(i,a,b) for(int i=(a);i>=(b);--i)
template<class T>void rd(T&x){int f=0,c;while(!isdigit(c=getchar()))f^=!(c^45);x=(c&15);while(isdigit(c=getchar()))x=x*10+(c&15);if(f)x=-x;}
template<class T>void pt(T x,int c=-1){if(x<0)putchar('-'),x=-x;if(x>9)pt(x/10);putchar(x%10+48);if(c!=-1)putchar(c);}
using namespace std;
using LL=long long;
using ULL=unsigned long long;
const int P=1000000021;
mt19937 rng(std::chrono::steady_clock::now().time_since_epoch().count());
int ad(int k1,int k2){return k1+k2>=P?k1+k2-P:k1+k2;}
int su(int k1,int k2){return k1-k2<0?k1-k2+P:k1-k2;}
int mu(int k1,int k2){return 1ULL*k1*k2%P;}
void uad(int&k1,int k2){(k1+=k2)>=P&&(k1-=P);}
void usu(int&k1,int k2){(k1-=k2)<0&&(k1+=P);}
template<class... T>int ad(int k1,T... k2){return ad(k1,ad(k2...));}
template<class... T>int su(int k1,T... k2){return su(k1,ad(k2...));}
template<class... T>int mu(int k1,T... k2){return mu(k1,mu(k2...));}
template<class... T>void uad(int&k1,T... k2){return uad(k1,ad(k2...));}
template<class... T>void usu(int&k1,T... k2){return usu(k1,ad(k2...));}
int po(int k1,int k2){
	int k3=1;
	for(;k2;k2>>=1,k1=mu(k1,k1))if(k2&1)k3=mu(k3,k1);
	return k3;
}
const int N=1005;
const int g=7;
int n,w[5],v[5],ans[5],a[N][N],b[N][N],c[N][N];
int det(int n){
	int ret=1;
	rep(i,1,n){
		if(!c[i][i]){
			rep(j,i+1,n)if(c[j][i]){swap(c[i],c[j]),ret=su(0,ret);break;}
			if(!c[i][i])return 0;
		}
		ret=mu(ret,c[i][i]);
		const int inv=po(c[i][i],P-2);
		rep(j,i+1,n){
			const int t=mu(c[j][i],inv);
			rep(k,1,n){
				c[j][k]=su(c[j][k],mu(c[i][k],t));
			}
		}
	}
	return ret;
}
void test(int n,int a[N][N],int *ans){
	rep(i,1,n){
		rep(j,1,n){
			b[i][j]=rng()%P;
			// b[i][j]=1;
		}
	}
	rep(k,0,4){
		rep(i,1,n)rep(j,1,n){
			c[i][j]=mu(b[i][j],w[a[i][j]*k%5]);
		}
		v[k]=det(n);
	}
	rep(j,0,4){
		int s=0;
		rep(i,0,4){
			uad(s,mu(v[i],w[(5-j)*i%5]));
		}
		// DD(j,s);
		if(s)ans[j%5]=1;
	}
}
int p[N],q[N];
int main(){
#ifdef xay5421
	freopen("a.in","r",stdin);
#endif
	w[0]=1;
	w[1]=po(g,(P-1)/5);
	rep(i,2,4)w[i]=mu(w[i-1],w[1]);
	/*rep(i,0,5){
		printf("%d ",po(w,i));
	}
	puts("");*/
	rd(n);
	rep(i,1,n)rep(j,1,n)rd(a[i][j]);
	const int K=100,T=1;
	if(n<=K){
		rep(_,1,T){
			test(n,a,ans);
		}
	}else{
		static int a_[N][N];
		auto swp=[&](int i,int j){rep(k,1,n)swap(a[k][i],a[k][j]);};
		rep(_,1,T){
			rep(i,2,n)swap(a[i],a[rng()%i+1]);
			rep(i,2,n)swp(i,rng()%i+1);
			int z[5]={1,0,0,0,0};
			for(int i=1;i<=n;i+=2){
				int dt=-1;
				rep(j,i+1,n){
					rep(k,i+1,n)if((a[i][i]+a[j][k])%5!=(a[j][i]+a[i][k])%5){
						dt=(a[i][i]+a[j][k]+10-a[j][i]-a[i][k])%5;
						swap(a[i+1],a[j]);
						swp(i+1,k);
						j=n+1;
						break;
					}
				}
				if(dt!=-1){
					int z_[5];
					memcpy(z_,z,sizeof(z));
					rep(k,0,4)if(z_[k])z[(k+dt)%5]=1;
				}else{
					break;
				}
			}
			if(count(z,z+5,1)==5){
				rep(i,0,4)ans[i]=1;
				break;
			}
			int cur[5]={1,0,0,0,0};
			for(int i=1;i<=n;i+=K){
				int j=min(n,i+K-1);
				rep(u,i,j)rep(v,i,j)a_[u-i+1][v-i+1]=a[u][v];
				/*D("!!\n");
				rep(u,1,j-i+1)rep(v,1,j-i+1)if(a_[u][v])D("(%d,%d)\n",u,v);*/
				int tmp[5]={0,0,0,0,0};
				test(j-i+1,a_,tmp);
				int new_cur[5]={0,0,0,0,0};
				rep(u,0,4)rep(v,0,4)if(cur[u]&&tmp[v])new_cur[(u+v)%5]=1;
				memcpy(cur,new_cur,sizeof(cur));
			}
			rep(k,0,4)ans[k]|=cur[k];
		}
	}
	rep(k,0,4)putchar(ans[k]?'Y':'N');
	return 0;
}