#include <set>
#include <map>
#include <queue>
#include <cmath>
#include <vector>
#include <random>
#include <cstdio>
#include <time.h>
#include <stdio.h>
#include <iomanip>
#include <stdlib.h>
#include <memory.h>
#include <string.h>
#include <iostream>
#include <algorithm>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef __int128 i128;

#define fi first
#define se second
#define mk make_pair

char buf[1 << 20],*p1 = buf,*p2 = buf;
inline char gc(){
	if (p1 == p2) p1 = buf,p2 = buf + fread(buf,1,1 << 20,stdin);
	if (p1 == p2) return EOF;
	return *p1++;
	// return getchar();
}

inline ll read(){
	ll t = 0,f = 1;
	register char c = gc();
	while (c < 48 || c > 57){
		if (c == EOF) exit(0);
		f = (c == '-') ? (-1) : (f),c = gc();
	}
	while (c >= 48 && c <= 57) t = (t << 1) + (t << 3) + (c ^ 48),c = gc();
	return f * t;
}

const int T = 12,P[T + 1] = {0,2,3,5,7,11,13,17,19,23,29,31,37};

ll mul(ll a,ll b,ll mod){
	ll ans = 0;
	a %= mod,b %= mod;
	for (;b;a = a * 9 % mod,b /= 9) ans = (ans + a * (b % 9)) % mod;
	return ans;
}

ll fap(ll a,ll p,ll mod){
	ll ans = 1;a %= mod;
	for (;p;p >>= 1,a = mul(a,a,mod)) if (p & 1) ans = mul(ans,a,mod);
	return ans % mod;
}

bool miller_rabin(ll a,ll p,ll x,ll y){//p-1=2^x*y
	a %= p;
	ll cur = fap(a,y,p),lst = -1;
	for (int _ = 1;_ <= x;_++){
		lst = cur,cur = mul(cur,cur,p);
		if (cur == 1 && lst != 1 && lst != p - 1) return 0;
		if (cur == 1) return 1;
	}
	return cur == 1;
}

bool check(ll a){
	if (a <= 2 || !(a & 1)) return a == 2;
	ll x = 0,y = a - 1;
	while (!(y & 1)) ++x,y >>= 1;
	for (int i = 1;i <= T;i++) if (!miller_rabin(P[i],a,x,y)) return 0;
	return 1;
}

void solve(){
	ll x;
	x = read();
	puts(check(x) ? "Y" : "N");
}

int main(){
#ifndef ONLINE_JUDGE
	freopen("in.in","r",stdin);
	// freopen("out.out","w",stdout);
#endif 
	while (1) solve();
	return 0;
}