#include<bits/stdc++.h>
#define Gc() getchar()
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define eb emplace_back
#define all(x) x.begin(),x.end()
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned ll;using pii=pair<int,int>;
const int N=2e5+5,M=N*100+5,K=1e7+5,mod=998244353,Mod=mod-1;const db eps=1e-9;const ll INF=5e18+7;mt19937 rnd(time(0));
#define Tp template<typename T>
#define Ts template<typename T,typename... Ar>
namespace Debug{
	Tp void _debug(char* f,T t){cerr<<f<<'='<<t<<endl;}
	Ts void _debug(char* f,T x,Ar... y){while(*f!=',') cerr<<*f++;cerr<<'='<<x<<",";_debug(f+1,y...);}
	#ifdef LOCAL
	#define gdb(...) _debug((char*)#__VA_ARGS__,__VA_ARGS__)
	#else 
	#define gdb(...) void()
	#endif
}using namespace Debug;
using LL=__int128;
ll mpow(ll x,ll y,ll p){ll ans=1;while(y) y&1&&(ans=(LL)ans*x%p),y>>=1,x=(LL)x*x%p;return ans;}
int ckp(ll x){
	mt19937_64 rnd(263082);
	if(x%2==0||x<=2) return x==2;
	int lim=20;
	ll y=x-1;int z=0;
	while(~y&1) y>>=1,z++;
	while(lim--){
		ll a=R(x-2)+1;
		a=mpow(a,y,x);
		if(a==1) continue;
		int flag=0;
		for(int j=1;j<=z;j++){
			if(a==x-1){flag=1;break;}
			a=(LL)a*a%x;
		}
		if(!flag) return 0;
	}
	return 1;
}
void Solve(){
	ll x;
	while(~scanf("%lld",&x)){
		printf("%c\n","NY"[ckp(x)]);
	}
}
int main(){
	int t=1;
	// scanf("%d",&t);
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}