#include <bits/stdc++.h>
using namespace std;

const int maxn = 1e4 + 233;
int n,m,T,a[maxn],b[maxn];
int mp[maxn][maxn], dist[maxn];
bool visit[maxn];
const int INF = 99999999;
void flyod()
{
    int i, j, k;
    for(k = 1; k <= n; k++)     //k为中间点
        for(i = 1; i <= n; i++)
            for(j = 1; j <= n; j++)
                if(mp[i][k] + mp[k][j] <  mp[i][j])
                    mp[i][j] = mp[i][k] + mp[k][j];
}
void init()     //初始化
{
    int i, j;
    for(i = 1; i < maxn; ++i)
    {
        for(j = 1; j < maxn; ++j)
        {
            if(i == j)
                mp[i][j] = 0;
            else
                mp[i][j] = mp[j][i] = INF;
        }
    }
}

void input()    //输入函数
{
    int vi, vj, cost;
    cin>>n;
    for(int i=1; i<=n; ++i)
    {
        for(int j=i+1; j<=n; ++j)
        {
            mp[i][j] = (i^j);
        }
    }
}
int main(int argc, char** argv)
{
    //freopen("in.txt","r",stdin);
    cin>>T;
    while(T--)
    {
        cin>>n;
        cout<<(n^1)<<endl;
    }
    return 0;
}