#include<bits/stdc++.h>
#define rep(i,a,b) for (int i=(a);i<=(b);i++)
#define drep(i,a,b) for (int i=(a);i>=(b);i--)
using namespace std;
typedef long long ll;

typedef __int128 i128;
inline i128 quick_pow(i128 x,i128 k,i128 mod)
{
	i128 res=1;
	while (k)
	{
		if (k&1) res=res*x%mod;
		k>>=1;
		x=x*x%mod;
	}
	return res;
}

vector<int> P={2,3,5,7,11,13,17,19,23,31,233,12341234,114514,123499999,13331,998244353};
bool isprime(i128 p)
{
	if (p<=27)
	{
		for (auto it:P) if (p==it) return 1;
		return 0;
	}
	if (p%2==0) return 0;

	i128 u=(p-1);
	int t=0;
	while (u%2==0) u>>=1,t++;

	for (auto x:P)
	{
		auto test=[&]()
		{
			i128 y=quick_pow(x,u,p);
			if (y==1||y==p-1) return 1;

			i128 lst=y;
			rep(i,1,t)
			{
				y=y*y%p;
				if (y==1)
				{
					if (lst!=p-1) return 0;
					return 1; 
				}
				lst=y;
			}
			if (y!=1) return 0;
			return 1;
		};

		if (!test()) return 0;
	}
	return 1;
}

int main()
{
	ios::sync_with_stdio(false); cin.tie(0);

	ll x;
	while (cin>>x)
	{
		auto it=isprime(x);
		if (it) printf("Y\n");
		else printf("N\n");
	}

	return 0;
}