// This Code was made by Chinese_zjc_.
#include <bits/stdc++.h>
std::mt19937 Rand(std::chrono ::system_clock::now().time_since_epoch().count());
int n, a[1024][1024], b[1024][1024], p[1024], q[1024], ans;
int plus(int A, int B)
{
    int res = 0;
    for (int i = 0; i != 5; ++i)
        if (B >> i & 1)
            res |= A << i;
    return (res | res >> 5) & ((1 << 5) - 1);
}
int solve(int xl, int xr, int yl, int yr)
{
    if (xr - xl == 1 && yr - yl == 1)
        return 1 << b[xl][yl];
    int xm = (xl + xr) >> 1, ym = (yl + yr) >> 1;
    return plus(solve(xl, xm, yl, ym), solve(xm, xr, ym, yr)) | plus(solve(xm, xr, yl, ym), solve(xl, xm, ym, yr));
}
signed main()
{
    std::ios::sync_with_stdio(false);
    std::cin >> n;
    for (int i = 0; i != n; ++i)
        for (int j = 0; j != n; ++j)
            std::cin >> a[i][j];
    while (n & (n - 1))
        ++n;
    std::iota(p, p + n, 0);
    std::iota(q, q + n, 0);
    do
    {
        std::shuffle(p, p + n, Rand);
        std::shuffle(q, q + n, Rand);
        for (int i = 0; i != n; ++i)
            for (int j = 0; j != n; ++j)
                b[p[i]][q[j]] = a[i][j];
        ans |= solve(0, n, 0, n);
    } while (clock() < 0.9 * CLOCKS_PER_SEC);
    for (int i = 0; i != 5; ++i)
        std::cout << (ans >> i & 1 ? "Y" : "N");
    std::cout << std::endl;
    return 0;
}