#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++) {
        map<int,int> mp;
        for(int j=1;j<=n;j++) {
            cin>>a[i][j];
            b[a[i][j]].push_back({i,j});
        }
    }

    set<int> row,col;
    while(row.size()<min(n,8) || col.size()<min(n,8)) {
        int f=0;
        for(int i=0;i<5;i++) {
            while(!b[i].empty() &&(row.find(b[i].back().first)!=row.end() && col.find(b[i].back().second)!=col.end())) b[i].pop_back();
            if(b[i].empty()) continue;
            f=1;
            row.insert(b[i].back().first);
            col.insert(b[i].back().second);
        }
        if(!f)break;
    }

    vector<int> R(row.begin(),row.end());
    vector<int> C(col.begin(),col.end());
    int base=0;
    for(int i=1;i<=n;i++) {
        if(col.find(i)==col.end()) {
            for(int j=1;j<=n;j++) {
                if(row.find(j)==row.end()) {
                    base=(base+a[j][i])%5;
                }
            }
            break;
        }
    }
    sort(C.begin(),C.end());
    int t=10000;
    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;
        t--;
        if(t==0) break;
    } 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();
}