#include <cstdio>
#include <cstring>
#include <algorithm>
#define int long long
using namespace std;

namespace Miller{
	int pcnt=12;
	int p[13]={2,3,5,7,11,13,17,19,61,2333,4567,24251};
	inline int calc(int x,int k,int p){
		int tmp=1;
		while(k){
			if(k&1) tmp=tmp*x%p;
			x=x*x%p;
			k>>=1;
		}
		return tmp;
	}
	inline bool check(int x,int p){
		if(x%p==0||calc(p%x,x-1,x)^1) return 1;
		int t,k=x-1;
		while((k^1)&1){
			t=calc(p%x,k>>=1,x);
			if((t^1)&&(t^(x-1))) return 1;
			if(!(t^(x-1))) return 0;
		}
		return 0;
	}
	inline bool MR(int x){
		if(x<2) return 0;
		for(int i=0;i<12;i++){
			if(!(x^p[i])) return 1;
			if(check(x,p[i])) return 0;
		}
		return 1;
	}
}

signed main(){
	int n;
	while(~scanf("%lld",&n)){
		puts(Miller::MR(n)?"Y":"N");
	}

	return 0;
}