#include <bits/stdc++.h>
#define ll long long
using namespace std;
const ll MAX = 1e6 + 5;
bool is_prime[MAX];
ll sum_d[MAX];
void sang(ll n){
fill(is_prime, is_prime + n + 1, true);
is_prime[0] = false;
is_prime[1] = false;
for(ll p = 2; p * p <= n; p++){
if(is_prime[p]){
for(ll i = p * p; i <= n; i+= p){
is_prime[i] = false;
}
}
}
for(ll i = 1; i <= n; i++){
for(ll j = i; j <= n; j += i){
sum_d[j] += i;
}
}
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);cout.tie(NULL);
sang(MAX);
ll n;
cin >> n;
while(n--){
ll a;
cin >> a;
if(2 * a <= sum_d[a]){
cout << "1" << "\n";
}
else{
cout << "0" << "\n";
}
}
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CiNkZWZpbmUgbGwgbG9uZyBsb25nCnVzaW5nIG5hbWVzcGFjZSBzdGQ7Cgpjb25zdCBsbCBNQVggPSAxZTYgKyA1Owpib29sIGlzX3ByaW1lW01BWF07CmxsIHN1bV9kW01BWF07CnZvaWQgc2FuZyhsbCBuKXsKICAgIGZpbGwoaXNfcHJpbWUsIGlzX3ByaW1lICsgbiArIDEsIHRydWUpOwogICAgaXNfcHJpbWVbMF0gPSBmYWxzZTsKICAgIGlzX3ByaW1lWzFdID0gZmFsc2U7CiAgICBmb3IobGwgcCA9IDI7IHAgKiBwIDw9IG47IHArKyl7CiAgICAgICAgaWYoaXNfcHJpbWVbcF0pewogICAgICAgICAgICBmb3IobGwgaSA9IHAgKiBwOyBpIDw9IG47IGkrPSBwKXsKICAgICAgICAgICAgICAgIGlzX3ByaW1lW2ldID0gZmFsc2U7CiAgICAgICAgICAgIH0KICAgICAgICB9CiAgICB9CiAgICBmb3IobGwgaSA9IDE7IGkgPD0gbjsgaSsrKXsKICAgICAgIGZvcihsbCBqID0gaTsgaiA8PSBuOyBqICs9IGkpewogICAgICAgICAgc3VtX2Rbal0gKz0gaTsKICAgICAgIH0KICAgIH0KfQoKaW50IG1haW4oKXsKICAgIGlvc19iYXNlOjpzeW5jX3dpdGhfc3RkaW8oZmFsc2UpOwogICAgY2luLnRpZShOVUxMKTtjb3V0LnRpZShOVUxMKTsKCiAgICBzYW5nKE1BWCk7CiAgICBsbCBuOwogICAgY2luID4+IG47CgogICAgd2hpbGUobi0tKXsKICAgICAgICBsbCBhOwogICAgICAgIGNpbiA+PiBhOwogICAgICAgIGlmKDIgKiBhICA8PSBzdW1fZFthXSl7CiAgICAgICAgICAgIGNvdXQgPDwgIjEiIDw8ICJcbiI7CiAgICAgICAgfQogICAgICAgIGVsc2V7CiAgICAgICAgICAgIGNvdXQgPDwgIjAiIDw8ICJcbiI7CiAgICAgICAgfQogICAgfQogICAgcmV0dXJuIDA7Cn0K