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 \le t \le 10^4$) — the number of test cases. Then $t$ test cases follow.

Each test case contains one integer $n$ ($2 \le n \le 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).


-----Examples-----

Input
6
2
3
4
5
998244353
1099511627776
Output
NO
YES
NO
YES
YES
NO


-----Note-----

None

Source: codeforces | Difficulty: EASY
Tags: Number theory

Mathematics


Solutions:
for k in [*open(0)][1:]:
	n = int(k)
	print('YNEOS'[n & n - 1 < 1::2])


def solve():
	n = int(input())
	if n % 2 != 0:
		print('YES')
	else:
		while n % 2 == 0:
			n //= 2
		if n == 1 or n == 0:
			print('NO')
		else:
			print('YES')
t = int(input())
for j in range(t):
	solve()


import math as m
t = int(input())
List = []
for i in range(0, t):
	n = int(input())
	List.append(n)
for num in List:
	d = m.log2(num)
	if d == m.ceil(d):
		print('NO')
	else:
		print('YES')


for M in [*open(0)][1:]:
	n = int(M)
	print('YNEOS'[n & n - 1 < 1::2])


def solve(n):
	if n % 2 != 0:
		return True

	def is_prime(n):
		if n == 1:
			return False
		i = 2
		while i * i <= n:
			if n % i == 0:
				return False
			i += 1
		return True
	if n & n - 1 == 0 or is_prime(n):
		return False
	return True
t = int(input())
while t:
	n = int(input())
	if solve(n):
		print('YES')
	else:
		print('NO')
	t -= 1


t = int(input())
for i in range(0, t):
	n = int(input())
	if n & 1:
		print('YES')
	elif n & n - 1:
		print('YES')
	else:
		print('NO')


def expo(a, n):
	if n == 0:
		return 1
	if n > 0 and n % 2 == 0:
		return a ** int(n / 2) * expo(a, n / 2)
	if n > 0 and n % 2 != 0:
		return a * expo(a, n - 1)
arr = [expo(2, i) for i in range(50)]
t = int(input())
for i in range(t):
	nn = int(input())
	if nn in arr:
		print('NO')
	else:
		print('YES')


import math
for i in range(int(input())):
	n = int(input())
	p = 0
	f = 0
	if n == 1:
		print('NO')
		continue
	while p < 65:
		if math.pow(2, p) == n:
			print('NO')
			f = 1
			break
		p = p + 1
	if f == 0:
		print('YES')


t = int(input())
i = 1
while i <= t:
	n = int(input())
	while n % 2 == 0:
		n = n / 2
	if n == 1:
		print('NO')
	else:
		print('YES')
	i += 1


import sys
input = sys.stdin.readline

def inp():
	return int(input())

def inlt():
	return list(map(int, input().split()))

def insr():
	s = input()
	return list(s[:len(s) - 1])

def invr():
	return map(int, input().split())

def odd_divisor(num):
	if num & num - 1 == 0:
		return 'NO'
	else:
		return 'YES'

def main():
	cases = inp()
	for _ in range(cases):
		number = inp()
		result = odd_divisor(number)
		print(result)
	return
main()


try:
	t = int(input())
except:
	pass
for _ in range(t):
	k = 0
	a = int(input())
	if a % 2 == 1:
		print('YES')
	else:
		while a % 2 != 1:
			a = a // 2
			if a == 2:
				break
		if a != 1 and a != 2:
			print('YES')
		else:
			print('NO')


t = int(input())
for test in range(t):
	n = int(input())
	while n % 2 == 0:
		n /= 2
	if n == 1:
		print('NO')
	else:
		print('YES')


t = int(input())
for i in range(t):
	n = int(input())
	if n & -n == n:
		print('NO')
	else:
		print('YES')


def isPowerOfTwo(x):
	return x and (not x & x - 1)
for i in range(int(input())):
	x = int(input())
	if isPowerOfTwo(x):
		print('NO')
	else:
		print('YES')


for i in range(int(input())):
	n = int(input())
	if n % 2 != 0:
		print('YES')
	elif n and (not n & n - 1):
		print('NO')
	else:
		print('YES')


for _ in range(int(input())):
	x = int(input())
	if x % 2 != 0:
		print('YES')
	elif x and (not x & x - 1):
		print('NO')
	else:
		print('YES')


t = int(input())
numbers_to_check = [int(input()) for i in range(t)]
max_num = max(numbers_to_check)
powers_of_two = [2]
powers_of_two_initial = 2
power = 2
final = []
while powers_of_two_initial < max_num:
	powers_of_two.append(2 ** power)
	powers_of_two_initial = powers_of_two[-1]
	power += 1
for num in numbers_to_check:
	if num in powers_of_two:
		final.append('NO')
	else:
		final.append('YES')
for word in final:
	print(word)


import sys
input = sys.stdin.readline
te = int(input())
while te > 0:
	n = int(input())
	while n > 1 and n % 2 == 0:
		n = n // 2
	if n == 1:
		print('NO')
	else:
		print('YES')
	te -= 1


for s in [*open(0)][1:]:
	n = int(s)
	print('YNEOS'[n & n - 1 == 0::2])


def num(n):
	while n % 2 == 0:
		n = int(n / 2)
	if n > 1:
		return 'YES'
	else:
		return 'NO'
for _ in range(int(input())):
	n = int(input())
	print(num(n))


import math

def Log2(x):
	if x == 0:
		return False
	return math.log10(x) / math.log10(2)

def isPowerOfTwo(n):
	return math.ceil(Log2(n)) == math.floor(Log2(n))
t = int(input())
out = []
for x in range(t):
	n = int(input())
	if isPowerOfTwo(n):
		out.append('NO')
	else:
		out.append('YES')
for x in range(t):
	print(out[x])


ans = []
for _ in range(int(input())):
	if int(bin(int(input()))[3:]):
		ans.append('YES')
	else:
		ans.append('NO')
print('\n'.join(ans))


t = int(input())
for kk in range(t):
	n = int(input())
	k = 0
	while n:
		if n % 2 != 0 and n != 1:
			k = 1
			break
		n = n // 2
	if k == 1:
		print('yes')
	else:
		print('no')


for i in range(int(input())):
	n = bin(int(input()))
	print('YES' if n.count('1') != 1 else 'NO')


import math
for _ in range(int(input())):
	n = int(input())
	if n % 2 == 1:
		print('YES')
		continue
	l = math.log(n, 2)
	if l == int(l):
		print('NO')
	else:
		print('YES')


import math

def solve():
	n = int(input())
	if n % 2 != 0:
		print('YES')
		return 0
	if n & n - 1 == 0:
		print('NO')
	else:
		print('YES')
T = int(input())
for i in range(T):
	solve()


import math

def gcd(a, b):
	if b == 0:
		return a
	else:
		return gcd(b, b % a)

def di(x):
	d = {}
	for i in x:
		if i in d:
			d[i] += 1
		else:
			d[i] = 1
	return d

def ma(x):
	return math.log2(x)

def ce(x):
	return math.ceil(x)

def lis():
	return list(map(int, input().split()))

def mapp():
	return map(int, input().split())

def ii():
	return int(input())
for _ in range(ii()):
	n = ii()
	x = math.log2(n)
	if str(x)[-2:] == '.0':
		print('NO')
	else:
		print('YES')


import sys
test = int(input())
while test:
	n = int(input())
	if n % 2 == 0:
		while n % 2 == 0:
			n /= 2
		if n > 1:
			print('YES')
		else:
			print('NO')
	else:
		print('YES')
	test -= 1


from sys import stdin
import sys
tt = int(stdin.readline())
ans = []
for loop in range(tt):
	n = int(stdin.readline())
	while n % 2 == 0:
		n //= 2
	if n > 1:
		ans.append('YES')
	else:
		ans.append('NO')
print('\n'.join(ans))


import logging
import sys
from inspect import currentframe
input = sys.stdin.readline
logging.basicConfig(level=logging.DEBUG)

def dbg(*args):
	id2names = {id(v): k for (k, v) in currentframe().f_back.f_locals.items()}
	logging.debug(', '.join((id2names.get(id(arg), '???') + ' = ' + repr(arg) for arg in args)))

def main():
	p2 = [0] * 51
	p2[0] = 2
	for i in range(50):
		p2[i + 1] = 2 * p2[i]
	t = int(input())
	for _ in range(t):
		n = int(input())
		if n in p2:
			print('NO')
		else:
			print('YES')
main()


T = int(input())
for _ in range(T):
	n = int(input())
	if n % 2:
		print('YES')
	else:
		while n % 2 == 0:
			n /= 2
		if n > 1:
			print('YES')
		else:
			print('NO')


t = int(input())
for _ in range(t):
	n = int(input())
	while n > 1 and n % 2 == 0:
		n //= 2
	print('YES' if n > 1 else 'NO')


for _ in range(int(input())):
	num = int(input())
	ans = 'NO'
	if num % 2 == 1:
		ans = 'YES'
	else:
		while num > 2:
			num = num // 2
			if num % 2 == 1:
				ans = 'YES'
				break
	print(ans)


import math
import sys
import os.path
if os.path.exists('input_file.txt'):
	sys.stdin = open('input_file.txt', 'r')
	sys.stdout = open('output_file.txt', 'w')
for i in range(int(input())):
	n = int(input())
	a = math.log2(n)
	aa = a - float(a // 1)
	if aa > 0:
		print('YES')
	else:
		print('NO')


n = int(input())
list1 = []
for i in range(n):
	num = int(input())
	list1.append(num)
for i in range(n):
	if list1[i] % 2 != 0:
		print('YES')
	elif list1[i] & list1[i] - 1 == 0:
		print('NO')
	else:
		print('YES')


for _ in range(int(input())):
	curr = int(input())
	print('YES') if curr & curr - 1 != 0 else print('NO')


from io import BytesIO, IOBase
import sys
import math
import os
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))

def input():
	return sys.stdin.readline().rstrip('\r\n')

def mint():
	return map(int, input().split())

def mfloat():
	return map(float, input().split())

def solve():
	n = int(input())
	print('NO' if math.log2(n).is_integer() else 'YES')

def main():
	t = int(input())
	for _ in range(t):
		solve()
main()


def fun():
	n = int(input())
	if n & n - 1:
		print('YES')
	else:
		print('NO')
t = int(input())
while t:
	fun()
	t = t - 1


t = int(input())
s = []
for i in range(t):
	c = 0
	n = int(input())
	while n % 2 == 0:
		n = n / 2
	if n == 1:
		c = 1
	if c == 1:
		s.append('NO')
	else:
		s.append('YES')
for i in range(t):
	print(s[i])


from sys import stdin
from sys import stdout
from math import *
import sys
input = stdin.readline
for __ in range(int(input())):
	n = int(input())
	s = bin(n)[2:]
	if s.count('1') == 1:
		print('NO')
	else:
		print('YES')


import math
n = int(input())
a = []
c = 0
d = 0
for i in range(n):
	c = int(input())
	a.append(c)
for i in a:
	if math.log2(i) % 1 == 0:
		print('NO')
	else:
		print('YES')


for I in [*open(0)][1:]:
	n = int(I)
	print('YNEOS'[n & n - 1 < 1::2])


import sys
input = sys.stdin.readline

def solve(n):
	while n % 2 == 0:
		n //= 2
	if n == 1:
		return 'NO'
	else:
		return 'YES'
t = int(input())
for _ in range(t):
	n = int(input())
	print(solve(n))


import math
t = int(input())
while t != 0:
	n = int(input())
	if math.log(n, 2) % 1 == 0.0:
		print('NO')
	else:
		print('YES')
	t -= 1


for _ in range(int(input())):
	n = int(input())
	while True:
		r = n % 2
		if n == 1:
			print('NO')
			break
		elif r == 1:
			print('YES')
			break
		n = n / 2


import os
import sys
from io import BytesIO, IOBase
from collections import Counter
from collections import OrderedDict
from collections import defaultdict
import bisect
import math
from sys import setrecursionlimit

def read():
	sys.stdin = open('input.txt', 'r')
	sys.stdout = open('output.txt', 'w')
abc = 'abcdefghijklmnopqrstuvwxyz'
abd = {'a': 0, 'b': 1, 'c': 2, 'd': 3, 'e': 4, 'f': 5, 'g': 6, 'h': 7, 'i': 8, 'j': 9, 'k': 10, 'l': 11, 'm': 12, 'n': 13, 'o': 14, 'p': 15, 'q': 16, 'r': 17, 's': 18, 't': 19, 'u': 20, 'v': 21, 'w': 22, 'x': 23, 'y': 24, 'z': 25}
mod = 1000000007

def gcd(a, b):
	if a == 0:
		return b
	return gcd(b % a, a)

def fre_count(mylist):
	return Counter(mylist)

def lcm(a, b):
	return a / gcd(a, b) * b

def main():
	t = int(input())
	for _ in range(t):
		n = int(input())
		x = n
		while n % 2 == 0:
			n = n // 2
		if n == 1:
			print('NO')
		else:
			print('YES')
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))

def input():
	return sys.stdin.readline().rstrip('\r\n')
main()


tests = int(input())
import math

def solve(n):
	while n % 2 == 0:
		n = n // 2
	if n == 1:
		return 'NO'
	else:
		return 'YES'
for t in range(tests):
	n = int(input())
	if n % 2 != 0:
		print('YES')
	else:
		print(solve(n))


from math import log2
t = int(input())
result = []
for i1 in range(t):
	n = int(input())
	l = log2(n)
	if l == int(l):
		result.append('NO')
	else:
		result.append('YES')
for i2 in result:
	print(i2)


t = int(input())
while t > 0:
	t -= 1
	n = int(input())
	if n & n - 1 == 0:
		print('No')
	else:
		print('Yes')


def solve():
	n = int(input())
	if n & 1:
		print('YES')
	else:
		from math import log2
		k = log2(n)
		if k == int(k):
			print('NO')
		else:
			print('YES')
for _ in range(int(input())):
	solve()


from math import *
t = int(input())
for j in range(t):
	n = int(input())
	while n % 2 == 0:
		n /= 2
	if n == 1:
		print('NO')
	else:
		print('YES')


from math import *
from sys import *
from bisect import *
from collections import *
t = int(stdin.readline())
for _ in range(t):
	n = int(stdin.readline())
	if n % 2 == 1:
		print('YES')
	else:
		while 1:
			n = n // 2
			if n == 1:
				print('NO')
				break
			elif n % 2 == 1:
				print('YES')
				break


for _ in range(int(input())):
	n1 = int(input())
	while n1 % 2 == 0:
		n1 /= 2
	if n1 == 1:
		print('NO')
	else:
		print('YES')


try:
	t = int(input())
	for i in range(t):
		n = int(input())
		if n & n - 1 == 0:
			print('NO')
		else:
			print('YES')
except:
	pass


for _ in range(int(input())):
	n = int(input())
	if n & n - 1:
		print('YES')
	else:
		print('NO')


for r in [*open(0)][1:]:
	n = int(r)
	print('YNEOS'[n & -n == n::2])


k = int(input())
for i in range(k):
	n = int(input())
	if n & n - 1 == 0 and n != 0:
		print('NO')
	else:
		print('YES')


for i in range(int(input())):
	n = int(input())
	yn = 0
	for j in range(100):
		if n == 1:
			break
		elif n % 2 == 1:
			yn = 1
			break
		n //= 2
	if yn == 1:
		print('Yes')
	else:
		print('No')


import sys
t = int(sys.stdin.readline())
for _ in range(t):
	n = int(sys.stdin.readline())
	res = n & n - 1
	if res:
		print('YES')
	else:
		print('NO')


from collections import deque
for _ in range(int(input())):
	n = int(input())
	if n & n - 1 == 0:
		print('NO')
	else:
		print('YES')


def solv(n):
	while n % 2 == 0:
		n = n // 2
	if n == 1:
		return 'NO'
	else:
		return 'YES'
for i in range(int(input())):
	print(solv(int(input())))


import math
for _ in range(int(input())):
	x = int(input())
	k = math.log2(x)
	if math.ceil(k) == math.floor(k):
		print('NO')
	else:
		print('YES')


def oddDivisors1(arr):
	s = set([2 ** i for i in range(1, 48)])
	for i in arr:
		if i in s:
			print('NO')
		else:
			print('YES')
arr = []
for i in range(int(input())):
	arr.append(int(input()))
oddDivisors1(arr)


for i in range(int(input())):
	n = int(input())
	while n % 2 == 0:
		n = n / 2
	if n == 1:
		print('NO')
	else:
		print('YES')


l = [1, 2, 4, 8, 16, 32, 64, 128, 256, 512, 1024, 2048, 4096, 8192, 16384, 32768, 65536, 131072, 262144, 524288, 1048576, 2097152, 4194304, 8388608, 16777216, 33554432, 67108864, 134217728, 268435456, 536870912, 1073741824, 2147483648, 4294967296, 8589934592, 17179869184, 34359738368, 68719476736, 137438953472, 274877906944, 549755813888, 1099511627776, 2199023255552, 4398046511104, 8796093022208, 17592186044416, 35184372088832, 70368744177664, 140737488355328, 281474976710656, 562949953421312]

def fun(n):
	if n in l:
		return 'NO'
	return 'YES'
for _ in range(int(input())):
	n = int(input())
	print(fun(n))


x = int(input())
for a in range(x):
	i = int(input())
	while i > 1:
		if i % 2 != 0:
			print('YES')
			break
		i = i / 2
	else:
		print('NO')


n = int(input())
for i in range(n):
	a = int(input())
	if a > 1:
		if a % 2 != 0:
			print('yes')
		elif bin(a).split('b')[1].count('1') == 1:
			print('no')
		else:
			print('yes')


def check(x):
	return x and (not x & x - 1)
for _ in range(int(input())):
	n = int(input())
	if check(n):
		print('NO')
	else:
		print('YES')


import math
t = int(input())
for _ in range(t):
	n = int(input())
	if math.log2(n) % 1 != 0:
		print('YES')
	else:
		print('NO')


class Solution:

	def solve(self, n):
		if n & n - 1:
			return 'YES'
		else:
			return 'NO'
sol = Solution()
tests = int(input())
for i in range(tests):
	n = int(input())
	result = sol.solve(n)
	print(result)


for _ in range(int(input())):
	n = int(input())
	if n == 1:
		print('NO')
	elif n % 2 != 0:
		print('YES')
	elif n & n - 1 == 0:
		print('NO')
	else:
		print('YES')


def solve():
	x = int(input())
	while x % 2 == 0:
		x /= 2
	if x == 1:
		return 'NO'
	else:
		return 'YES'
t = int(input())
while t > 0:
	print(solve())
	t -= 1


import sys
import math

def II():
	return int(sys.stdin.readline())

def LI():
	return list(map(int, sys.stdin.readline().split()))

def MI():
	return map(int, sys.stdin.readline().split())

def SI():
	return sys.stdin.readline().strip()

def FACT(n, mod):
	s = 1
	facts = [1]
	for i in range(1, n + 1):
		s *= i
		s %= mod
		facts.append(s)
	return facts[n]

def C(n, k, mod):
	return FACT(n, mod) * pow(FACT(k, mod) * FACT(n - k, mod) % mod, mod - 2, mod) % mod
t = II()
for i in range(t):
	n = II()
	print('YES' if math.log(n, 2) != int(math.log(n, 2)) else 'NO')


n = int(input())
nums = []
for i in range(n):
	nums.append(int(input()))
for num in nums:
	if num & num - 1:
		print('YES')
	else:
		print('NO')


t = int(input())
m = []
for i in range(t):
	m.append(int(input()))
for i in m:
	if bin(i).count('1') == 1:
		print('NO')
	else:
		print('YES')


import sys
pin = sys.stdin.readline
for T in range(int(pin())):
	N = int(pin())
	while N % 2 == 0:
		N //= 2
	print(['NO', 'YES'][N != 1])


t = int(input())
arr = []
for i in range(1, 65):
	arr.append(2 ** i)
for i in range(t):
	n = int(input())
	if n in arr:
		print('NO')
	else:
		print('YES')


import sys
input = sys.stdin.readline

def inp():
	return int(input())

def inlt():
	return list(map(int, input().split()))

def insr():
	s = input()
	return list(s[:len(s) - 1])

def invr():
	return map(int, input().split())
num = inp()
for i in range(0, num):
	j = inp()
	while j >> 1 > 1:
		if j % 2 == 1:
			break
		j = j >> 1
	print('NO' if j % 2 == 0 else 'YES')


import sys
import math
from sys import stdin, stdout

def get_ints_in_variables():
	return map(int, sys.stdin.readline().strip().split())

def get_ints_in_list():
	return list(map(int, sys.stdin.readline().strip().split()))

def get_string():
	return sys.stdin.readline().strip()

def Solution(n):
	if n % 2 == 1:
		print('YES')
		return
	while n % 2 == 0:
		n = n // 2
	if n == 1:
		print('NO')
	else:
		print('YES')

def main():
	for _ in range(int(stdin.readline())):
		n = int(input())
		Solution(n)
main()


t = int(input())
for tt in range(t):
	n = int(input())
	if n & n - 1 == 0:
		print('NO')
	else:
		print('YES')


import sys
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
f_inf = float('inf')
mod = 10 ** 9 + 7

def resolve():
	t = int(input())
	for _ in range(t):
		n = int(input())
		while n % 2 == 0:
			n //= 2
		print('NO' if n == 1 else 'YES')
resolve()


import sys
input = sys.stdin.readline

def inp():
	return int(input())

def inlt():
	return list(map(int, input().split()))

def insr():
	s = input()
	return list(s[:len(s) - 1])

def invr():
	return map(int, input().split())

def solve(n):
	if bin(n).count('1') == 1:
		return 'NO'
	else:
		return 'YES'
for _ in range(inp()):
	n = inp()
	print(solve(n))


n = int(input())
i = 0
m = 0
z = 0
nums = []
while i < n:
	m = int(input())
	nums.append(m)
	i += 1
for number in nums:
	z += 1
	while number % 2 == 0:
		number = number / 2
	if number == 1:
		print('NO')
	else:
		print('YES')


n = int(input())
for _ in range(0, n):
	t = int(input())
	if t % 2 != 0:
		print('Yes')
	else:
		while t % 2 == 0:
			t = t / 2
		if t > 1:
			print('Yes')
		else:
			print('No')


tc = int(input())
while tc:
	tc -= 1
	n = int(input())
	if n & n - 1 == 0:
		print('NO')
	else:
		print('YES')


for _ in range(int(input())):
	n = int(input())
	while not n % 2:
		n //= 2
	print('YES' if n > 1 else 'NO')


t = int(input())
nums = []
for _ in range(t):
	nums.append(int(input()))
for n in nums:
	if n & n - 1:
		print('YES')
	else:
		print('NO')


import math

def prime(num):
	if num > 1:
		s = int(math.sqrt(num / 2))
		for i in range(2, s + 1):
			if num % i == 0:
				return 'NO'
				break
		return 'YES'
	return 'NO'
inputs = input()
l = []
for i in range(int(inputs)):
	num = int(input())
	while num % 2 == 0:
		num = num / 2
	if num == 1:
		l.append('NO')
	else:
		l.append('YES')
[print(x) for x in l]


test_cases = 1
test_cases = int(input())
for ttttt in range(test_cases):
	n = int(input())
	while n % 2 == 0:
		n /= 2
	if n == 1:
		print('NO')
	else:
		print('YES')


s = []
for i in range(1, 50):
	s.append(2 ** i)
n = int(input())
for i in range(n):
	a = int(input())
	if a in s:
		print('NO')
	else:
		print('YES')


print(*list(map(lambda n: 'YNEOS'[1 << n.bit_length() == n << 1::2], [int(input()) for _ in '.' * int(input())])), sep='\n')


import math
t = int(input())
for t in range(t):
	n = int(input())
	if n % 2 != 0:
		print('YES')
	elif n < 6:
		print('NO')
	else:
		v = math.log2(n)
		if math.ceil(v) == math.floor(v):
			print('NO')
		else:
			print('YES')


for _ in range(int(input())):
	n = int(input())
	if n % 2 == 1:
		print('YES')
	elif (n and (not n & n - 1)) == True:
		print('NO')
	else:
		print('YES')


even_list = [2]
while True:
	n = even_list[-1] * 2
	if n > 10 ** 14:
		break
	even_list.append(n)
t = int(input())
for _ in range(t):
	n = int(input())
	if n in even_list:
		print('No')
	else:
		print('Yes')


t = int(input())
for qq in range(t):
	n = int(input())
	if n & n - 1:
		print('YES')
	else:
		print('NO')


for _ in range(int(input())):
	n = int(input())
	s = bin(n)[2:]
	if s.count('1') == 1:
		print('NO')
	else:
		print('YES')


import math

def Log2(x):
	if x == 0:
		return false
	return math.log10(x) / math.log10(2)

def isPowerOfTwo(n):
	return math.ceil(Log2(n)) == math.floor(Log2(n))
t = int(input(''))
for i in range(t):
	k = int(input(''))
	if isPowerOfTwo(k):
		print('NO')
	else:
		print('YES')


from math import *
from collections import defaultdict as dt
from sys import stdin
inp = lambda : stdin.readline().strip()
intinp = lambda : int(inp())
mapinp = lambda : map(int, stdin.readline().split())
listinp = lambda : list(map(int, stdin.readline().split()))
mod = 1000000009
inf = 100000000000000000000
ss = 'abcdefghijklmnopqrstuvwxyz'

def prime(n):
	prime = [True for i in range(n + 1)]
	p = 2
	while p * p <= n:
		if prime[p] == True:
			for i in range(p * p, n + 1, p):
				prime[i] = False
		p += 1
	c = []
	for p in range(2, n):
		if prime[p]:
			c.append(p)
	return c

def factors(n):
	i = 1
	p = []
	while i <= sqrt(n):
		if n % i == 0:
			p.append(i)
			if n / i != i:
				p.append(n // i)
		i = i + 1
	return p

def primefacfre(n):
	d = dt(lambda : 0)
	while n % 2 == 0:
		d[2] = d[2] + 1
		n = n / 2
	for i in range(3, int(sqrt(n)) + 1, 2):
		while n % i == 0:
			d[i] = d[i] + 1
			n = n / i
	if n > 2:
		d[n] = d[n] + 1
	return d

def sortvalues(x):
	return dict(sorted(x.items(), key=lambda item: item[1]))

def sortkeys(d):
	return dict(sorted(d.items()))

def solve():
	n = intinp()
	if n & n - 1 == 0:
		print('NO')
	else:
		print('YES')
tt = 1
tt = intinp()
for _ in range(tt):
	solve()


for _ in range(int(input())):
	n = int(input())
	print('YNEOS'[n & n - 1 == 0::2])


n = int(input())
memo = {}
for _ in range(n):
	k = int(input())
	if k % 2:
		print('YES')
	else:
		x = k
		if k in memo:
			print(memo[k])
		else:
			while x % 2 == 0 and x != 2:
				x = x // 2
				if x % 2 == 1:
					break
			if x % 2:
				memo[k] = 'YES'
				print('YES')
			else:
				memo[k] = 'NO'
				print('NO')


blanck = [2 ** i for i in range(0, 50)]
for i in range(int(input())):
	x = int(input())
	if x in blanck:
		print('NO')
	else:
		print('YES')


import sys
d = {}
for i in range(1, 47):
	d.update({2 ** i: i})
for _ in range(int(sys.stdin.readline())):
	n = int(sys.stdin.readline())
	if n in d:
		print('NO')
	else:
		print('YES')


import sys

def get_ints():
	return map(int, sys.stdin.readline().strip().split())

def get_list():
	return list(map(int, sys.stdin.readline().strip().split()))

def get_list_string():
	return list(map(str, sys.stdin.readline().strip().split()))

def get_string():
	return sys.stdin.readline().strip()

def get_int():
	return int(sys.stdin.readline().strip())

def get_print_int(x):
	sys.stdout.write(str(x) + '\n')

def get_print(x):
	sys.stdout.write(x + '\n')

def get_print_int_same(x):
	sys.stdout.write(str(x) + ' ')

def get_print_same(x):
	sys.stdout.write(x + ' ')
from sys import maxsize

def solve():
	for _ in range(get_int()):
		n = get_int()
		if n & n - 1 == 0:
			get_print('NO')
		else:
			get_print('YES')
solve()


t = int(input(''))
A = []
for i in range(t):
	n = int(input(''))
	A.append(n)
x = 2
y = 1
kamus = []
while x ** y <= 100000000000000:
	kamus.append(x ** y)
	y += 1
for i in range(t):
	n = A[i]
	if n % 2 == 1:
		print('YES')
	elif n in kamus:
		print('NO')
	else:
		print('YES')


def solution(n):
	if n & n - 1 == 0:
		return 'NO'
	return 'YES'

def adaptor():
	t = int(input())
	while t > 0:
		n = int(input())
		result = solution(n)
		print(result)
		t -= 1
adaptor()


arr = [2 ** i for i in range(1, 50)]
for _ in range(int(input())):
	n = int(input())
	if n in arr:
		print('NO')
	else:
		print('YES')


cases = int(input())
l = []
while cases > 0:
	n = int(input())
	if n % 2 != 0 and n != 1:
		l.append('YES')
	elif n == 1:
		l.append('NO')
	else:
		while n % 2 == 0 and n > 0:
			n = n / 2
		if n != 1:
			l.append('YES')
		else:
			l.append('NO')
	cases -= 1
for item in l:
	print(item)


def odd_divisor(x):
	odd = 3
	for i in range(0, x, 1):
		if x & x - 1:
			return 'YES'
		else:
			return 'NO'
t = int(input())
results = []
for i in range(0, int(t), 1):
	n = int(input())
	results.append(odd_divisor(n))
for i in range(0, t, 1):
	print(results[i])


import os, sys
from io import BytesIO, IOBase
from collections import Counter
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')


import math

def od(n):
	while n % 2 == 0:
		n = n / 2
	if n == 1:
		return False
	return True
k = int(input())
while k > 0:
	n = int(input())
	if od(n):
		print('YES')
	else:
		print('NO')
	k -= 1


cases = int(input())
full_list = [int(input()) for i in range(cases)]

def divisor_verify(full_list):
	for i in full_list:
		if i & i - 1 == 0:
			print('NO')
		else:
			print('YES')
divisor_verify(full_list)


from sys import stdin

def readint():
	return int(stdin.readline())

def readarray(typ):
	return list(map(typ, stdin.readline().split()))

def isPowerOfTwo(x):
	return x and (not x & x - 1)
for _ in range(readint()):
	n = readint()
	if n & 1:
		print('YES')
	elif isPowerOfTwo(n):
		print('NO')
	else:
		print('YES')


t = int(input())
b = []
for i in range(t):
	a = int(input())
	if a & a - 1:
		b.append('YES')
	else:
		b.append('NO')
for i in b:
	print(i)


t = int(input())
for ts in range(t):
	n = int(input())
	if n % 2 != 0:
		print('YES')
	elif n == 2:
		print('NO')
	elif n & n - 1 != 0:
		print('YES')
	else:
		print('NO')


def fun(n):
	if n & n - 1 != 0:
		return 'YES'
	return 'NO'
t = int(input())
for i in range(t):
	n = int(input())
	print(fun(n))


import math
for _ in range(int(input())):
	n = int(input())
	if math.log2(n) == int(math.log2(n)):
		print('NO')
	else:
		print('YES')


for _ in range(int(input())):
	a = int(input())
	v = bin(a)
	if v.count('1') == 1:
		print('no')
	else:
		print('yes')


f = {1 << i for i in range(100)}
for t in range(int(input())):
	n = int(input())
	if n in f:
		print('NO')
	else:
		print('YES')


test_cases = int(input())
numbers = [int(input()) for i in range(test_cases)]
import math

def find_divisor(num):
	ans = math.log2(num)
	if ans.is_integer():
		print('NO')
	else:
		print('YES')
for number in numbers:
	find_divisor(num=number)


for _ in range(int(input())):
	x = int(input())
	print('YNEOS'[x & x - 1 == 0::2])


def doit():
	n = int(input())
	print('NO' if n == 1 << len(bin(n)) - 3 else 'YES')
T = int(input())
for _ in range(T):
	doit()


def read_input(filename: str=None) -> None:
	from sys import stdin
	stdin = open(filename) if filename else stdin
	cases = int(stdin.readline())
	while cases:
		cases = cases - 1
		value = int(stdin.readline())
		print('YES') if value & value - 1 else print('NO')

def main():
	read_input()
main()


def odd_divisior():
	for i in range(int(input())):
		a = int(input())
		bit = a & a - 1
		if bit == 0:
			print('NO')
		else:
			print('YES')
odd_divisior()


for test in range(int(input())):
	n = int(input())
	a = bin(n)[2:]
	b = a.count('1')
	if n % 2 != 0:
		print('YES')
		continue
	if b == 1:
		print('NO')
	else:
		print('YES')


import sys
for i in range(int(sys.stdin.readline())):
	n = int(sys.stdin.readline())
	while n % 2 == 0:
		n //= 2
	sys.stdout.write('YES\n' if n != 1 else 'NO\n')


import collections

def solveTestCase():
	n = bin(int(input().split()[0]))[2:]
	if n.count('1') == 1:
		print('NO')
	else:
		print('YES')
t = int(input().split()[0])
while t > 0:
	t -= 1
	solveTestCase()


import math
try:
	t = int(input())
	while t > 0:
		t -= 1
		n = int(input())
		flag = 0
		if n % 2 != 0:
			flag = 1
		else:
			while n > 2:
				n = n // 2
				if n % 2 != 0:
					flag = 1
					break
		if flag:
			print('YES')
		else:
			print('NO')
except:
	pass


tc = int(input())
for i in range(tc):
	n = int(input())
	has_odd_factors = False
	if n == 1:
		has_odd_factors = False
	while n > 1:
		if n % 2 != 0:
			has_odd_factors = True
		n /= 2
	if has_odd_factors:
		print('YES')
	else:
		print('NO')


for i in range(int(input())):
	a = int(input())
	b = bin(a)
	b = list(b)
	l = b.count('1')
	if l == 1 and b[2] == '1':
		print('NO')
	else:
		print('YES')


t = int(input())
while t:
	n = int(input())
	count = 0
	while n:
		n = n & n - 1
		count += 1
	if count == 1:
		print('NO')
	else:
		print('YES')
	t -= 1


a = int(input())
for i in range(a):
	liczba = int(input())
	if liczba == 2 or liczba == 1:
		print('NO')
	elif liczba % 2 != 0:
		print('YES')
	else:
		while True:
			liczba = liczba / 2
			if liczba == 1:
				print('NO')
				break
			if liczba % 2 != 0:
				print('YES')
				break


from math import *
t = int(input())
for i in range(t):
	a = int(input())
	k = 'NO'
	if a % 2 == 1:
		k = 'YES'
	else:
		while a > 0:
			a = a // 2
			if a % 2 == 1 and a > 1:
				k = 'YES'
	print(k)


def func(n):
	if n == 1:
		return 'NO'
	if n % 2 != 0:
		return 'YES'
	return func(n // 2)
t = int(input())
for _ in range(t):
	n = int(input())
	print(func(n))


import sys
t = int(sys.stdin.readline())
for i in range(t):
	n = int(sys.stdin.readline())
	flag = 0
	idx = 2
	while n > 1:
		if n % idx == 0:
			n //= idx
		else:
			flag = 1
			break
	if flag:
		print('YES')
	else:
		print('NO')


import math

def Log2(x):
	return math.log10(x) / math.log10(2)
for _ in range(int(input())):
	n = int(input())
	if math.ceil(Log2(n)) == math.floor(Log2(n)):
		print('No')
	else:
		print('Yes')