#include<bits/stdc++.h>
using namespace std;
#define rep2(i,j,k) for(ll i = ll(j); i < ll(k); i++)
#define rep(i,k) rep2(i,0,k)
#define rrep2(i,j,k) for(ll i = ll(j)-1; i >= ll(k); i--)
#define rrep(i,k) rrep2(i,k,0)
#define all(a) a.begin(), a.end()
#define SZ(a) ll(a.size())
#define eb emplace_back
using ll = long long;
using P = pair<ll,ll>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vp = vector<P>;
using vvp = vector<vp>;
const ll inf = LLONG_MAX/4;
bool chmin(auto& a, auto& b) {return a > b ? a = b, 1 : 0; }
bool chmax(auto& a, auto& b) {return a < b ? a = b, 1 : 0; }

void solve() {
	int x;
	cin >> x;
	for(int i = 1; i*i <= x; i++) {
		if(x%i) continue;
		if(i*2 >= x/i) {
			cout << 1 << '\n';
			return;
		}
	}
	cout << 0 << '\n';
}

int main(){
	cin.tie(0)->sync_with_stdio(0);
	int n;
	cin >> n;
	rep(_, n) solve();
}