// sis puella oier
#include <bits/stdc++.h>
using namespace std;
// #define int long long
typedef long long ll;
ll read(){
    ll xx = 0, f = 1; char ch = getchar();
    for (;!isdigit(ch); ch = getchar())f = (ch == '-' ? -1 : 1);
    for (; isdigit(ch); ch = getchar())xx = (xx << 3) + (xx << 1) + ch - '0';
    return xx * f;
}
int n, a[1100][1100], f[1100][(1 << 12) + 12], g[1100][(1 << 12) + 12];
int b[15][15], h[15][(1 << 12) + 12], ppc[(1 << 12) + 12];
int calc(int x, int ad){
    ad %= 5;
    return ((x << ad) | (x >> (5 - ad))) & 31;
}
int work(int m){
    for (int i = 0; i <= m; ++i)for (int s = 0; s < (1 << m); ++s)h[i][s] = 0;
    h[0][0] = 1;
    for (int i = 0; i < m; ++i)for (int s = 0; s < (1 << m); ++s)if (h[i][s]){
        for (int j = 0; j < m; ++j)if (s >> j & 1);
        else h[i + 1][s | (1 << j)] |= calc(h[i][s], b[i + 1][j + 1]);
    }
    return h[m][(1 << m) - 1];
}
signed main(){
    n = read();
    for (int i = 1; i <= n; ++i)for (int j = 1; j <= n; ++j)a[i][j] = read();
    if (n <= 12){
        for (int i = 1; i <= n; ++i)for (int j = 1; j <= n; ++j)b[i][j] = a[i][j];
        int ans = work(n);
        for (int i = 0; i < 5; ++i)if (ans >> i & 1)printf("Y");
        else printf("N"); printf("\n"); return 0;
    }
    for (int d = 1; d <= 6; ++d){
        bool fl = false;
        for (int i = d; i <= n && !fl; ++i)for (int j = d; j <= n && !fl; ++j)
            if (a[2*d-1][2*d-1] + a[i][j] != a[2*d-1][j] + a[i][2*d-1]){
                for (int k = 1; k <= n; ++k)swap(a[2*d][k], a[i][k]);
                for (int k = 1; k <= n; ++k)swap(a[k][2*d], a[k][j]);
                fl = true;
            }
        if (!fl){
            --d; d *= 2;
            for (int i = d + 2; i <= n; ++i){
                int val = (a[d + 1][d + 1] - a[i][d + 1] + 5) % 5;
                for (int j = 1; j <= n; ++j)(a[i][j] += val) %= 5;
            }
            for (int j = d + 1; j <= n; ++j){
                int val = (5 - a[d + 1][j]) % 5;
                for (int i = 1; i <= n; ++i)(a[i][j] += val) %= 5;
            }
            for (int i = d + 1; i <= n; ++i)for (int j = d + 1; j <= n; ++j)assert(a[i][j] == 0);

            f[d][0] = 1, g[d][0] = 1;
            for (int i = d; i < n; ++i)for (int s = 0; s < (1 << d); ++s)if (f[i][s] > 0){
                f[i + 1][s] |= f[i][s];
                for (int j = 0; j < d; ++j)if (s >> j & 1);
                else f[i + 1][s | (1 << j)] |= calc(f[i][s], a[i + 1][j + 1]);
            }
            for (int j = d; j < n; ++j)for (int s = 0; s < (1 << d); ++s)if (g[j][s] > 0){
                g[j + 1][s] |= g[j][s];
                for (int i = 0; i < d; ++i)if (s >> i & 1);
                else g[j + 1][s | (1 << i)] |= calc(g[j][s], a[i + 1][j + 1]);
            }

            int ans = 0; ppc[0] = 0; for (int i = 1; i < (1 << d); ++i)ppc[i] = ppc[i >> 1] + (i & 1);
            for (int s1 = 0; s1 < (1 << d); ++s1)if (f[n][s1] > 0)
            for (int s2 = 0; s2 < (1 << d); ++s2)if (g[n][s2] > 0 && ppc[s1] == ppc[s2]){
                int cx = 0;
                for (int i = 0; i < d; ++i)if ((s1 >> i & 1) == 0){
                    int cy = 0; ++cx;
                    for (int j = 0; j < d; ++j)if ((s2 >> j & 1) == 0)b[cx][++cy] = a[i][j];
                }
                int val = work(cx); int it = 0;
                for (int i = 0; i < 5; ++i)if (f[n][s1] >> i & 1)it |= calc(val, i);
                val = it; it = 0;
                for (int j = 0; j < 5; ++j)if (g[n][s2] >> j & 1)it |= calc(val, j);
                val = it; it = 0;
                ans |= val;
            }
            for (int i = 0; i < 5; ++i)if (ans >> i & 1)printf("Y");
            else printf("N"); printf("\n");
            return 0;
        }
    }
    printf("YYYYY\n");
    return 0;
}