#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;
}