#include <bits/stdc++.h>

typedef unsigned long long u64;

const int N = 5;

u64 n;

inline u64 addint(u64 x) { return x < n ? x : x - n; }
inline u64 mul(u64 x, u64 y) { return ((__uint128_t)x * y) % n; }
inline void Add(u64 &x, u64 y) { x += y; if (x >= n) x -= n; }

struct mat { u64 a[N][N]; };

mat *I, *P, *Q;

inline void MatMul(mat *A, mat *B, mat *C) {
	for (int i = 0; i < N; ++i)
		for (int j = i; j < N; ++j) {
			u64 t = 0;
			for (int k = 0; k < N; ++k) Add(t, mul(A->a[i][k], B->a[k][j]));
			C->a[i][j] = t;
			if (i != j) C->a[j][i] = C->a[i][j];
		}
}

inline mat QuickPow(mat *R, u64 n) {
	mat mre = *R, mbb = *I, mt = *I;
	mat *re = &mre, *bb = &mbb, *t = &mt;
	while (n > 0) {
		if (n & 1) {
			MatMul(bb, re, t);
			std::swap(t, bb);
		}
		n >>= 1;
		MatMul(re, re, t);
		std::swap(t, re);
	}
	return *bb;
}

bool isP(mat *x, mat *y) {
	for (int i = 0; i < N; ++i)
		if (x->a[i][i] != addint(y->a[i][i] + 1)) return 0;
	for (int i = 0; i < N; ++i)
		for (int j = i + 1; j < N; ++j)
			if (x->a[i][j] != y->a[i][j]) return 0;
	return 1;
}

void init_mat() {
	I = new mat({1, 0, 0, 0, 0,
				 0, 1, 0, 0, 0,
				 0, 0, 1, 0, 0,
				 0, 0, 0, 1, 0, 
				 0, 0, 0, 0, 1});
	P = new mat({	1,	2,	5,	11,	37,
				 	2,	1,	17,	31,	13,
				 	5,	17,	1,	23,	7,
				 	11,	31,	23,	1,	3,
				 	37,	13,	7,	3,	1	});
	Q = new mat({	0,	2,	5,	11,	37,
				 	2,	0,	17,	31,	13,
				 	5,	17,	0,	23,	7,
				 	11,	31,	23,	0,	3,
				 	37,	13,	7,	3,	0	});
}

int main() {
	init_mat();
	while (scanf("%llu", &n) != EOF) {
		if (n == 1) { puts("N"); continue; }
		mat PP = QuickPow(P, n), QQ = QuickPow(Q, n);
		puts(isP(&PP, &QQ) ? "Y" : "N");
	}
	return 0;
}