#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")

using namespace std;

const int N = 1005;

int a[N][N], p[N];
bool b[30];

signed main() {
    int n; scanf("%d", &n);
    for (int i = 1; i <= n; ++i)
    for (int j = 1; j <= n; ++j) {
        scanf("%d", &a[i][j]);
    }
    for (int j = 1; j <= n; ++j) p[j] = j;
    mt19937 rnd(13137);
    double now = clock();
    while (clock() - now < 0.93 * CLOCKS_PER_SEC) {
        int S = 0;
        for (int j = 1; j <= n; ++j) S += a[j][p[j]];
        S = S % 5 + 10;
        b[S] = 1;
        int flg = 0;
        for (int j = 1; j <= n; ++j) {
            for (int k = j + 1; k <= n; ++k) {
                if (!b[S - a[j][p[j]] - a[k][p[k]] + a[j][p[k]] + a[k][p[j]]]) {
                    flg = b[S - a[j][p[j]] - a[k][p[k]] + a[j][p[k]] + a[k][p[j]]] = 1;
                    S = (S - a[j][p[j]] - a[k][p[k]] + a[j][p[k]] + a[k][p[j]]) % 5 + 10;
                    swap(p[j], p[k]);
                }
            }
        }
        if (!flg) shuffle(p + 1, p + n + 1, rnd);
    }
    for (int i = 0; i < 5; ++i) {
        bool t = 0;
        for (int j = i; j < 30; j += 5) t |= b[j];
        putchar("NY"[t]);
    }
    puts("");
    return 0;
}