#include<iostream>
#include<algorithm>
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<queue>
#include<math.h>
#include<cmath>
using namespace std;

long long n;

void maxx(int &a,int &b)
{
    if(a<b)
    {
        int t = a;
        a = b;
        b = t;
    }
}

int main()
{
    int t;
    //cin>>t;
    
    scanf("%d",&t);
    while(t--)
    {
        //cin>>n;
        scanf("%lld",&n);
        int x,y;
        int flag = 0;
        int minn = 999999;
        int m = sqrt(n*1.0);
        for(int i=m; i>=1;i--)
        {
            if(n%i == 0)
            {
                x = i;
                y = n/i;
                if(x!=y)
                {
                    maxx(x,y);
                    if((x%2 == 0 && y%2 == 0) || (x%2 == 1 && y%2 == 1))
                    {
                        flag = 1;
                        break;
                    }
                }
            }
        }
        if(flag == 0)
        {
            printf("False\n");
        }
        else
        {
            printf("True\n");
        }
    }
    //system("pause");
    return 0;
}