#include <bits/stdc++.h>
using namespace std;
const int N=1005;
bool prime[N];
void sieve(){
	memset(prime,true,sizeof(prime));
	prime[1]=prime[0]=false;
	int sq=sqrt(N-5);
	for(int i=2;i<=sq;i++){
		if(prime[i]){
			for(int j=i*i;j<=N-5;j+=i){
				prime[j]=false;
			}
		}
	}
}
signed main(){
	freopen("CAU1.INP","r",stdin);
	freopen("CAU1.OUT","w",stdout);
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int t;
	cin>>t;
	sieve();
	while(t--){
		int x;
		cin>>x;
		if(prime[x])cout<<"1";
		else cout<<0;
		cout<<"\n";
	}
	//Author by
	//Bao Dat
}