#include <bits/stdc++.h>
using namespace std;
#define For(Ti,Ta,Tb) for(auto Ti=(Ta);Ti<=(Tb);++Ti)
#define Dec(Ti,Ta,Tb) for(auto Ti=(Ta);Ti>=(Tb);--Ti)
#define debug(...) fprintf(stderr,__VA_ARGS__)
#define range(Tx) begin(Tx),end(Tx)
using ll=long long;
using i128=__int128;
mt19937 eng(random_device{}());
template<typename T>
T rand(const T &_l,const T &_r){
	return uniform_int_distribution<T>(_l,_r)(eng);
}
ll power(ll x,ll y,ll mod){
	ll r=1;
	for(;y;y>>=1,x=i128(x)*x%mod){
		if(y&1) r=i128(r)*x%mod;
	}
	return r;
}
bool miller_rabin(ll n){
	if(n<=2||n%2==0) return n==2;
	ll k=n-1,o=0;
	for(;k%2==0;k/=2,++o);
	For($,1,10){
		ll a=rand(2LL,n-1),cur=power(a,k,n);
		if(cur==1) continue;
		For(i,0,o){
			if(i==o) return 0;
			if(cur==n-1) break;
			cur=i128(cur)*cur%n;
		}
	}
	return 1;
}
ll pollard_rho(ll n){
	ll c=rand(1LL,n-1),s=c,t=0;
	auto f=[&](ll x){
		return (i128(x)*x+c)%n;
	};
	int step=0,lim=1;
	ll prod=1;
	while(s!=t){
		prod=i128(prod)*abs(s-t)%n;
		if((++step)==lim){
			ll d=__gcd(prod,n);
			if(d>1) return d;
			step=0;
			lim=min(127,lim*2);
		}
		s=f(f(s));
		t=f(t);
	}
	ll d=__gcd(prod,n);
	return d>1?d:n;
}
vector<pair<ll,int>> factorize(ll n){
	map<ll,int> mp;
	queue<ll> q;
	q.push(n);
	while(q.size()){
		ll u=q.front();
		q.pop();
		if(u<=1) continue;
		if(miller_rabin(u)){
			++mp[u];
			continue;
		}
		ll d=u;
		for(;d==u;d=pollard_rho(u));
		q.push(d);
		q.push(u/d);
	}
	return vector<pair<ll,int>>(range(mp));
}
int main(){
	cin.tie(nullptr)->sync_with_stdio(false);
	ll n;
	while(cin>>n){
		cout<<(miller_rabin(n)?'Y':'N')<<'\n';
	}
	return 0;
}