source_code: import java.util.*;
  import java.lang.*;
  import java.io.*;
  
  public class Main
  {
  	PrintWriter out = new PrintWriter(System.out);
  	BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
      StringTokenizer tok = new StringTokenizer("");
      String next() throws IOException {
          if (!tok.hasMoreTokens()) { tok = new StringTokenizer(in.readLine()); }
          return tok.nextToken();
      }
      int ni() throws IOException { return Integer.parseInt(next()); }
      long nl() throws IOException { return Long.parseLong(next()); }
      
      long mod=1000000007;
      
      void solve() throws IOException {
          for (int tc=ni();tc>0;tc--) {
              long n=ni();
              long q=1;
              long p=1;
              boolean f=false;
              while (true) {
                  if (p*2==n || p*4==n) { f=true; break; }
                  q++;
                  p=q*q;
                  if (p>n) break;
              }
              if (f) out.println("YES");
              else out.println("NO");
          }
          out.flush();
      }
      
      int gcd(int a,int b) { return(b==0?a:gcd(b,a%b)); }
      long gcd(long a,long b) { return(b==0?a:gcd(b,a%b)); }
      long mp(long a,long p) { long r=1; while(p>0) { if ((p&1)==1) r=(r*a)%mod; p>>=1; a=(a*a)%mod; } return r; }
      
      public static void main(String[] args) throws IOException {
          new Main().solve();
      }
  }