#include <iostream>
#include <map>
#include <deque>
using namespace std;
deque<int> dq;
map<int,bool> lucky;
void check_prime(){
    dq.push_back(2);
    dq.push_back(3);
    for(int i=4;i<=1e6+5;i++){
        dq.push_back(i);
        int ans=0;
        for(auto el:dq){
            if(el * el > i)break;
            if(i%el==0){
                ans++;
                dq.pop_back();
                if(ans>3) break;
            }
        }
        if(ans==2)lucky[i]=true;
    }
}
int main(){
    ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
    check_prime();
    int n;
    cin >> n;
    while(n--){
        int temp;
        cin >> temp;
        cout << lucky[temp] << endl;
    }
}

???