C :

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

C++ :

#include<iostream>
#include<cstdio>
#include<iostream>
#include<cmath>

using namespace std;

int isPrime(int n){
    if(n<2)
        return 0;
    for(int i=2;i<=sqrt(n);i++)
        if(n%i==0)
            return 0;
    return 1;
}

int main(){
    int n;
    while(cin>>n){
        while(n--){
            int m;
            cin>>m;
            if(isPrime(m))
                cout<<"Yes"<<endl;
            else
                cout<<"No"<<endl;
        }
    }
    return 0;
}

Pascal :

var
a,b,n:integer;
c:int64;
begin
readln(n);
for n:=1 to n do
begin
readln(a);
b:=a-1;
c:=1;
for b:=1 to b do
c:=c*2;
if a=2 then writeln('Yes')
else if c mod a=1 then writeln('Yes')
else writeln('No');
end;
end.