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

const int N = 1005;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
// mt19937 rng(114);

bool mp[N][N], vis[N], can[N];
int magic[N];
int a[N][N], lnk[N];
int n, m, res;

bool dfs(int u) {
    for (int _ = 1; _ <= n; _++) {
        int i = magic[_];
        if (!vis[i] && mp[u][i] && lnk[i] != u) {
            vis[i] = 1;
            if (!lnk[i] || dfs(lnk[i])) {
                res += a[u][i] - a[lnk[i]][i];
                lnk[i] = u;
                return true;
            }
        }
    }
    return false;
}

int main() {
    scanf("%d", &n), m = 5;
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n; j++) {
            scanf("%d", &a[i][j]);
            if (a[i][j] >= 0) {
                mp[i][j] = 1;
            }
        }
    }
    for (int i = 1; i <= n; i++) magic[i] = i;
    for (int i = 1; i <= n; i++) {
        memset(vis, 0, sizeof(bool) * (n + 1));
        if (!dfs(i)) {
            for (int j = 0; j < m; j++) putchar('N');
            return 0;
        }
        // printf("init i = %d\n", i);
        // for (int j = 1; j <= n; j++)
        //     printf("lnk[%d] = %d\n", j, lnk[j]);
    }
    // printf("current res = %d\n", res);
    can[res % m] = 1;
    while (clock() / 1. / CLOCKS_PER_SEC <= 0.9) {
        // printf("now !\n");
        // for (int i = 1; i <= n; i++)
        //     printf("lnk[%d] = %d\n", i, lnk[i]);
        int pos = rng() % n + 1;
        shuffle(magic + 1, magic + n + 1, rng);
        for (int i = 1; i <= n; i++)
            if (lnk[i] == pos) {
                res -= a[pos][i];
                lnk[i] = 0;
                break;
            }
        memset(vis, 0, sizeof(bool) * (n + 1));
        dfs(pos);
        // if (res % m == m - 1) {
        //     break;
        // }
        can[res % m] = 1;
    }
    for (int i = 0; i < m; i++) {
        putchar(can[i] ? 'Y' : 'N');
    }
    return 0;
}