You are given an integer n. Check if n has an odd divisor, greater than one (does there exist such a number x (x > 1) that n is divisible by x and x is odd).

For example, if n=6, then there is x=3. If n=4, then such a number does not exist.

Input

The first line contains one integer t (1 ≤ t ≤ 10^4) — the number of test cases. Then t test cases follow.

Each test case contains one integer n (2 ≤ n ≤ 10^{14}).

Please note, that the input for some test cases won't fit into 32-bit integer type, so you should use at least 64-bit integer type in your programming language.

Output

For each test case, output on a separate line: 

  * "YES" if n has an odd divisor, greater than one; 
  * "NO" otherwise. 



You can output "YES" and "NO" in any case (for example, the strings yEs, yes, Yes and YES will be recognized as positive).

Example

Input


6
2
3
4
5
998244353
1099511627776


Output


NO
YES
NO
YES
YES
NO
import java.math.BigInteger;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collection;
import java.util.Collections;
import java.util.HashMap;
import java.util.HashSet;
import java.util.LinkedList;
import java.util.List;
import java.util.Map;
import java.util.PriorityQueue;
import java.util.Scanner;
import java.util.Set;
import java.util.TreeMap;
import java.util.TreeSet;
import java.util.Map.Entry;

public class A {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int t = sc.nextInt();
        while (t-- > 0) {
            long n = sc.nextLong();
            boolean flag = false;
            while (n != 0) {
                if (n % 2 != 0 && n != 1) {
                    flag = true;
                    break;
                }
                n = n / 2;
            }
            if (flag)
                System.out.println("YES");
            else
                System.out.println("NO");
        }

    }

    static int calculatenCr(int n, int r) {
        if (r > n)
            return 0;
        return factorial(n) / (factorial(n - r) * factorial(r));
    }

    static int factorial(int n) {
        if (n == 0 || n == 1)
            return 1;
        int ans = 1;
        while (n-- > 0) {
            ans *= n;
            n--;
        }
        return ans;
    }

    static long lcm(long a, long b) {
        return (a / gcd(a, b) * b);
    }

    static long gcd(long a, long b) {
        if (b == 0)
            return a;
        return gcd(b, a % b);
    }

    static class Container implements Comparable<Container> {
        long a;
        long b;

        public Container(long a, long b) {
            this.a = a;
            this.b = b;
        }

        @Override
        public int compareTo(Container o) {
            if (Math.max(this.a, this.b) > Math.min(o.a, o.b))
                return -1;
            else if (Math.max(this.a, this.b) < Math.min(o.a, o.b))
                return 1;
            else
                return 0;
        }

        public String toString() {
            return a + " " + b;
        }

    }
}