#include <time.h>
#include <random>
#include <stdio.h>
#include <algorithm>
int c[1001], d[1001], a[1001][1001], b[1001][1001]; bool f[1001][5];
int main()
{
    std::mt19937 g((1 << 30) - 35); bool e[5] = {};
    int n; scanf("%d", &n);
    for (int i(1); i <= n; ++i)
    {
        c[i] = d[i] = i;
        for (int j(1); j <= n; ++j) scanf("%d", &a[i][j]);
    }
    for (int t(1); t <= 140; ++t)
    {
        std::shuffle(c + 1, c + n + 1, g); std::shuffle(d + 1, d + n + 1, g);
        for (int i(1); i <= n; ++i) for (int j(1); j <= n; ++j) b[c[i]][d[j]] = a[i][j];
        std::swap(a, b);
        for (int i(1); i <= n; ++i) for (int j(0); j < 5; ++j) f[i][j] = false;
        f[0][0] = true;
        for (int i(1); i <= n; ++i) for (int j(i), h(0);; h += a[j][j + 1], ++j)
        {
            h += a[j][i];
            for (int k(0); k < 5; ++k) f[j][(k + h) % 5] |= f[i - 1][k];
            h -= a[j][i];
            if (j == n) break;
        }
        for (int i(0); i < 5; ++i) e[i] |= f[n][i];
    }
    for (int i(0); i < 5; ++i) putchar(e[i] ? 'Y' : 'N');
    return !putchar('\n');
}