#include<bits/stdc++.h>
using namespace std;
using ll=long long;
using i128=__int128_t;
ll ksm(ll a,ll b,ll mod)
{
	ll ans=1;
	while(b)
	{
		if(b&1) ans=(i128)(ans)*a%mod;
		b>>=1;
		a=(i128)(a)*a%mod;
	}
	return ans;
}
bool MillerRabin(ll x)
{
	if(x%2==0||x<3) return x==2;
	vector<ll> primes={2,325,9375,28178,450775,9780504,1795265022};
	// vector<ll> primes;
	// for(int i=2;i<=80;i++)
	// 	primes.push_back(i);
	for(auto pr:primes)
	{
		ll val=ksm(pr,x-1,x);
		if(!val) continue;
		if(val!=1) return false;
		ll lst=val;
		ll cur=x-1;
		while(cur%2==0)
		{
			cur/=2;
			val=ksm(pr,cur,x);
			if(val!=1&&val!=x-1) return false;
			lst=val;
			if(lst!=1) break;
		}
	}
	return true;
}
int main()
{
	ll x;
	while(cin>>x)
	{
		if(MillerRabin(x))
			cout<<"Y\n";
		else
			cout<<"N\n";
	}
	return 0;
}