#include <bits/stdc++.h>
using namespace std;
int num[1000001];
bool pnj(int n)
{
for (int i=2;i*i<=n;i++)
if (n%i==0) return false;
return true;
}
int main()
{
int n,a,ans=0;
cin>>n;
while (n--)
{
cin>>a;
for (int i=2;i<=n;i++)
if (pnj(i))
while (a%i==0)
{
a/=i;
num[i]++;
}
for (int i=1;i<=n;i++)
if (num[i]>0) ans++;
if (ans==2) cout<<1<<endl;
else cout<<0;
ans=0;
memset(num,0,sizeof(num));
}
return 0;
}