#include <bits/stdc++.h>
#define FOR(i, l, r) for (int i = (l); i <= (r); ++i)
#define ROF(i, r, l) for (int i = (r); i >= (l); --i)
#define popc(x) __builtin_popcount(x)
#define allc(x) (x).begin(), (x).end()
#define SZ(v) (int)v.size()
#define PII pair<int, int>
#define PB push_back
#define MP make_pair
#define FI first
#define SE second
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
bool Mbe;
template <typename A, typename B>
void chkmax(A &a, B b) {
    a = a > b ? a : b;
}
template <typename A, typename B>
void chkmin(A &a, B b) {
    a = a < b ? a : b;
}
namespace lyl {
    const int N = 1e3 + 5;
    int a[N][N], trans[1 << 5][5], n, ans, pt[N], idx[N], idy[N], b[N][N];
    mt19937 rnd(time(0));
    int calc() {
        FOR (i, 1, n) {
            idx[i] = i;
            idy[i] = i;
        }
        shuffle(idx + 1, idx + n + 1, rnd);
        shuffle(idy + 1, idy + n + 1, rnd);
        FOR (i, 1, n) {
            FOR (j, 1, n) {
                a[i][j] = b[idx[i]][idy[j]];
            }
        }
        memset(pt, 0, sizeof(pt));
        pt[0] = 1;
        FOR (i, 1, n) {
            int sum = 0;
            FOR (j, i, n) {
                pt[j] |= trans[pt[i - 1]][(sum + a[j][i]) % 5];
                sum += a[j][j + 1];
            }
        }
        return pt[n];
    }
    void solve() {
        cin >> n;
        FOR (i, 1, n) {
            FOR (j, 1, n) {
                cin >> a[i][j];
                b[i][j] = a[i][j];
            }
        }
        FOR (S, 0, (1 << 5) - 1) {
            FOR (x, 0, 4) {
                FOR (y, 0, 4) {
                    if (S & (1 << y)) {
                        trans[S][x] |= 1 << ((x + y) % 5);
                    }
                }
            }
        }
        FOR (_, 1, 300) {
            ans |= calc();
        }
        FOR (i, 0, 4) {
            if ((ans >> i) & 1) {
                cout << "Y";
            } else {
                cout << "N";
            }
        }
        cout << '\n';
    }
}
bool Meb;
int main() {
    // freopen(".in", "r", stdin);
    // freopen(".out", "w", stdout);
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    lyl::solve();
    // cerr << "Space: " << abs(&Meb - &Mbe) / 1024.0 / 1024.0 << "MB\n";
    // cerr << "Time: " << clock() * 1000.0 / CLOCKS_PER_SEC << "ms\n";
    return 0;
}