XOXO likes to play with numbers.So,given a number N help XOXO to find whether it is a fibonacci number or not.It won't be hard!
 

Input
First line contains T denoting the number of test case.
The next T line contains an integer N

Output
For every test case print(without quotes) "Yes" if N is a fibonacci number else output "No"

Constraints

1 ≤ T ≤ 10000
1 ≤ N ≤ 100000

 

Example
Input:
2
3
10

Output:
Yes
No
x = [0,1]
m = 2
l = 0
while l<1000000000:
	l = x[m-1]+x[m-2]
	x.append(l)
	m+=1
t = int(raw_input())
while t:
	t -= 1
	n = int(raw_input())
	if n in x:
		print 'Yes'
	else:
		print 'No'