#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define i128 __int128
#define pii pair<int, int>
#define pll pair<ll, ll>
#define all(x) (x).begin(), (x).end()
bool be;
mt19937 rd(time(0));
constexpr int N = 1e3 + 5;
int n, to[1 << 5][5], a[N][N], b[N], c[N], d[N][N], f[N];
void init()
{
	for (int S = 0; S < 1 << 5; ++S) {
		for (int i = 0; i < 5; ++i) {
			for (int j = 0; j < 5; ++j) {
				int x = (i + j) % 5;
				if ((S >> j) & 1) to[S][i] |= 1 << x;
			}
		}
	} 
}
int solve()
{
	iota(b + 1, b + 1 + n, 1);
	iota(c + 1, c + 1 + n, 1);
	shuffle(b + 1, b + 1 + n, rd);
	shuffle(c + 1, c + 1 + n, rd);
	for (int i = 1; i <= n; ++i) {
		for (int j = 1; j <= n; ++j) {
			d[i][j] = a[b[i]][c[j]];
		}
	}
	memset(f, 0, sizeof f);
	f[0] = 1;
	for (int i = 1; i <= n; ++i) {
		int cnt = 0;
		for (int j = i; j <= n; ++j) {
			f[j] |= to[f[i - 1]][(cnt + d[j][i]) % 5];
			cnt += d[j][j + 1];
		}
	}
	return f[n];
}
bool en;
int main()
{
#ifdef IAKIOI
	cerr << (&be - &en) / 1024.0 / 1024 << " MB\n----------------------------" << endl;
	freopen("in.in", "r", stdin);
	// freopen("out.out", "w", stdout);
#endif
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	init();
	cin >> n;
	for (int i = 1; i <= n; ++i) {
		for (int j = 1; j <= n; ++j) {
			cin >> a[i][j];
		}
	}
	int ans = 0;
	for (int i = 1; i <= 300; ++i) ans |= solve();
	for (int i = 0; i < 5; ++i) {
		cout << (((ans >> i) & 1) ? 'Y' : 'N');
	}
	return 0;
}