#include<bits/stdc++.h>
using namespace std;
int main(){
	int a;
    cin>>a;
    int u;
    int q=0;
    for(int i=1;i<=a;i++){
        cin>>u;
        for(int z=1;z<=a;z++){
            if(i%z==0){
                q++;
            }
            
        }
        if(q==2){
            cout<<"Yes"<<endl;
        }else{
            cout<<"No"<<endl;
        }
            q=0;
    }
	return 0;
}

C :

#include <stdio.h>
int main(){
    int a, n, i, f;
    scanf("%d", &n);
    while(n--){
        scanf("%d", &a);
        f= a==1?0:1;
        for(i = 2; i*i <= a; i++){
            if(a%i==0 && a!=2){
                f=0;
                break;
            }
        }
        printf("%s\n", f?"Yes":"No");
    }
    return 0;
}

C++ :

#include<stdio.h>
#include<math.h>
int main()
{
	int i,j,count;
	scanf("%d",&count);
	while(count--)
	{
	scanf("%d",&i);
	if(i<0)break;
	for(j=2;j<=sqrt(i);j++)
		if(i%j==0)break;
    if(i==1||i==0)printf("No\n");
	else if(j>sqrt(i))  printf("Yes\n");
	else printf("No\n");
	}
	return 0;
}

Java :

import java.util.Scanner;
public class Main
{
	public static void main(String[] args)
	{
		Scanner sc=new Scanner(System.in);
		int t=sc.nextInt();
		while(t-->0)
		{
			int num=sc.nextInt();
			int result=isPrime(num);
			if(result==1&&num!=0&&num!=1)
				System.out.println("Yes");
			else
				System.out.println("No");
		}
	}
	public static int isPrime(int num)//判断是否为素数
	{
		int temp = (int)Math.sqrt(num)+1;
		for(int i=2;i<temp;i++)
		{
			if(num%i==0)
				return 0;
		}
		return 1;
	}
}