#include<iostream>#include<cstdlib>#include<cstdio>#include<ctime>usingnamespace std;typedeflonglong ll;
ll mult_mod(ll a,ll b,ll Mod){//快乘法,防止快速幂溢出
ll ans =0;while(b){if(b&1)
ans =(ans+a)%Mod;
a = a*2%Mod;
b >>=1;}return ans;}
ll pow_mod(ll a,ll b,ll Mod){//快速幂
ll ans =1, base = a;while(b){if(b&1)
ans =mult_mod(ans,base,Mod);
base =mult_mod(base,base,Mod);
b >>=1;}return ans;}
ll Pow(ll a,ll b,ll Mod){
ll ans =1,base = a;while(b){if(b&1)
ans =(ans*base)%Mod;
base =(base*base)%Mod;
b >>=1;}return ans;}boolMiller_Rabin(ll n,ll a){//米勒拉宾素数测试
ll d = n-1, s =0;while(!(d&1)){//求(2^s)*d中的s和d.
d >>=1;
s ++;}
ll k =pow_mod(a,d,n);if(k ==1)returntrue;for(int j=0; j<s; j++){if(k == n-1)returntrue;
k =mult_mod(k,k,n);//快乘}returnfalse;}boolIsPrime(ll n){
ll a[4]={3,4,7,11};for(int i=0; i<4; i++){if(n == a[i])returntrue;if(!n%a[i])returnfalse;if(n>a[i]&&!Miller_Rabin(n,a[i]))returnfalse;}returntrue;}intmain(){
ll n;while(~scanf("%lld",&n)){if(n ==2)printf("Yes\n");elseif(n<2||!(n&1))printf("No\n");elseif(IsPrime(n))printf("Yes\n");elseprintf("No\n");}return0;}