#include<bits/stdc++.h>
# define ll long long
const ll N = 2000000;
using namespace std;
ll ordinary(ll n)
{
if(n==1)return 0;
if(n==2)return 1;
for(int i=2;i<=sqrt(n);i++)
if(n%i==0)return 0;
return 1;
}
ll prime[N],num_prime=0;
ll isNotPrime[N]={1,1};//默认1为非素数
void pre()//筛选N内素数
{
for(ll i=2;i<N;i++)
{
if(!isNotPrime[i])
prime[num_prime++]=i;
for(ll j=0;j<num_prime&&i*prime[j]<N;j++)
{
isNotPrime[i*prime[j]]=1;
if(!(i%prime[j]))break;
}
}
}
int main()
{
ll n;
pre();
while(cin>>n)
{
if(ordinary(n))
cout<<"yes"<<endl;
if(!isNotPrime[n])
cout<<"yes"<<endl;
}
}