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 os, sys
from io import BytesIO, IOBase
from collections import Counter
# Fast IO Region
BUFSIZE = 8192


class FastIO (IOBase):
    newlines = 0

    def __init__(self, file):
        self._fd = file.fileno ()
        self.buffer = BytesIO ()
        self.writable = "x" in file.mode or "r" not in file.mode
        self.write = self.buffer.write if self.writable else None

    def read(self):
        while True:
            b = os.read (self._fd, max (os.fstat (self._fd).st_size, BUFSIZE))
            if not b:
                break
            ptr = self.buffer.tell ()
            self.buffer.seek (0, 2), self.buffer.write (b), self.buffer.seek (ptr)
        self.newlines = 0
        return self.buffer.read ()

    def readline(self):
        while self.newlines == 0:
            b = os.read (self._fd, max (os.fstat (self._fd).st_size, BUFSIZE))
            self.newlines = b.count (b"\n") + (not b)
            ptr = self.buffer.tell ()
            self.buffer.seek (0, 2), self.buffer.write (b), self.buffer.seek (ptr)
        self.newlines -= 1
        return self.buffer.readline ()

    def flush(self):
        if self.writable:
            os.write (self._fd, self.buffer.getvalue ())
            self.buffer.truncate (0), self.buffer.seek (0)


class IOWrapper (IOBase):
    def __init__(self, file):
        self.buffer = FastIO (file)
        self.flush = self.buffer.flush
        self.writable = self.buffer.writable
        self.write = lambda s: self.buffer.write (s.encode ("ascii"))
        self.read = lambda: self.buffer.read ().decode ("ascii")
        self.readline = lambda: self.buffer.readline ().decode ("ascii")
sys.stdin, sys.stdout = IOWrapper (sys.stdin), IOWrapper (sys.stdout)
input = lambda: sys.stdin.readline ().rstrip ("\r\n")
def sieve(n):
    p = [1 for i in range (n + 1)]
    z = 2
    while z * z <= n:
        if p[z] == 1:
            for i in range (z * z, n + 1, z):
                p[i] = 0
        z += 1
    primes = [2]
    for i in range (3, n + 1, 2):
        if p[i]:
            primes.append (i)
    return set (primes)
def ordinarynunm(x):
    ans = 0
    k = 0
    for i in range (9):
        k = k + 10 ** i
        for t in range (1, 10):
            if t * k <= x:
                ans += 1
    return ans
for _ in range(int(input())):
    x=int(input())
    while x>=2:
        x=x/2
    if x==1:
        print("NO")
    else:
        print("YES")




