1087 1 10 100 1000

#include <iostream>
#include <cstdio>
#include <unordered_map>
using namespace std;
const int N = 1e9+2;
unordered_map<int, bool> mp;
//用哈希表存储哪些位置上有1，然后直接查找 
int main(){
	int k = 1, i = 1;
	mp[1] = true;
	while(i < N){
		i = i + k;
		mp[i] = true;
		k++;
	}
	int T, x;
	cin>>T;
	while(T--){
		cin>>x;
		if(mp[x]) cout<<1<<endl;
		else cout<<0<<endl;
	}
	return 0;
}