#include<bits/stdc++.h>
using namespace std;


int n;
int a[1003][1003];
vector<pair<int,int>> b[5];
int vis[5];
void solve() {
    cin>>n;
    for(int i=1;i<=n;i++) {
        for(int j=1;j<=n;j++) {
            cin>>a[i][j];
            b[a[i][j]].push_back({i,j});
        }
    }

    bitset<1003> vr,vc;
    int cr=0,cc=0;
    while(cr<min(n,8) || cc<min(n,8)) {
        int f=0;
        for(int i=0;i<5;i++) {
            while(!b[i].empty() &&(vr[b[i].back().first] && vc[b[i].back().second])) b[i].pop_back();
            if(b[i].empty()) continue;

            if(cr<min(n,8) && !vr[b[i].back().first]) cr++,vr[b[i].back().first]=1,f=1;
            if(cc<min(n,8) && !vc[b[i].back().second]) cc++,vc[b[i].back().second]=1,f=1;
        }
        if(!f)break;
    }

    vector<int> R;
    vector<int> C;
    vector<int> resR,resC;
    for(int i=1;i<=n;i++) {
        if(!vr[i] && cr<cc ) vr[i]=1,cr++;
        if(!vc[i] && cc<cr ) vc[i]=1,cc++;

        if(vr[i])R.push_back(i);
        else resR.push_back(i);
        if(vc[i])C.push_back(i);
        else resC.push_back(i); 
    }

    int base=0;
    random_shuffle(resR.begin(),resR.end());
    for(int i=0;i<resR.size();i++) {
        base=(base+a[resR[i]][resC[i]])%5;
    }
    
    // for(auto x:R) cout<<"R "<<x<<endl;
    // for(auto y:C) cout<<"C "<<y<<endl;

    do {
        int sum=0;
        for(int i=0;i<R.size();i++) {
            sum=(sum+a[R[i]][C[i]])%5;
        }
        vis[(base+sum)%5]=1;
    } while(next_permutation(C.begin(),C.end()));

    for(int i=0;i<5;i++) {
        if(vis[i]) cout<<"Y";
        else cout<<"N";
    }

}
signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0),cout.tie(0);

    int t=1;
    // cin>>t;
    while(t--)
    solve();
}