51nod 1087 1 10 100 1000

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <queue>
#include <map>
using namespace std;
#define LL long long
#define INF 0x3f3f3f3f
#define PI acos(-1.0)
#define E 2.71828
#define MOD 1000000007
#define N 1010

int main()
{
int t;
scanf("%d",&t);
while(t--)
{
int n;
scanf("%d",&n);
n = (n-1)*2;
int x = (int)sqrt(n);
if( x*(x+1)== n)
printf("1\n");
else
printf("0\n");
}
return 0;
}