#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
using namespace std;
int read(){int z=0,mark=1;  char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')mark=-1;  ch=getchar();}
	while(ch>='0'&&ch<='9'){z=(z<<3)+(z<<1)+ch-'0';  ch=getchar();}
	return z*mark;
}
int lie[11000000],ltop;
int n;
void get_lie(){
	lie[0]=1;
	for(int i=1;lie[i-1]<=1000000000;i++){
		lie[i]=lie[i-1]+i-1;
		ltop=i;
	}
	//for(int i=1;i<=20;i++)  cout<<lie[i]<<" ";
}
int fen(int x){
	int fleft=1,fright=ltop,mid;
	while(fleft+1<fright){
		mid=(fleft+fright)>>1;
		if(lie[mid]>=x)  fright=mid;
		else  fleft=mid;
	}
	return (lie[fleft]==x || lie[fright]==x);
}
int main(){
	//freopen("ddd.in","r",stdin);
	freopen("unlessseq.in","r",stdin);
	freopen("unlessseq.out","w",stdout);
	get_lie();
	cin>>n;
	int _left;
	while(n --> 0){//趋向于
		_left=read();
		printf("%d\n",fen(_left));
	}
	return 0;
}