HDU2161

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int maxn = 16005;
int vis[maxn];

void Init()
{
memset(vis, 0, sizeof(vis));
vis[1] = 1;
for(int i = 2; i <= maxn; i++)
{
for(int j = i+i; j <= maxn; j +=i)
vis[j] = 1;
}
return ;
}
int main()
{
Init();
int n, kase = 1;
while(~scanf("%d", &n))
{
if(n <= 0) break;
if(n == 1 || n == 2)
{
printf("%d: no\n", kase++);
continue;
}
if(!vis
) printf("%d: yes\n", kase++);
else printf("%d: no\n", kase++);
}
return 0;
}