#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <queue>
#include <cstring>
#define maxn 1000007
#define modp 1000000007LL

typedef long long LL;
typedef unsigned long long ULL;
int n,m,T,tot;

using namespace std;

LL qpow(int x, int y)
{
    if (y<=0) return 1;
    LL res=qpow(x,y>>1);
    res*=res;
    if (y&1) res*=x;
    return res;
}

LL exp_mod(LL a, LL b, LL p)
{
    LL tmp = a % p, ans =1;
    while(b)
    {
        if(b & 1)  ans = ans * tmp % p;
        tmp = tmp*tmp % p;
        b >>=1;
    }
    return  ans;
}

LL CC(LL n,LL m)
{
    LL res=1;
    if (n-m<m) m=n-m;
    for (LL i=n;i>n-m;--i)
    {
        res*=i;
        res/=n-i+1;
    }
    return res%modp;
}


int main()
{
    scanf("%d",&T);
    //T=100;
    while (T--)
    {
        LL n;
        scanf("%I64d",&n);
        if ((n&1)&&n!=1||n%4==0&&n!=4) printf("True\n"); else printf("False\n");
    }
    return 0;
}