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
#!/bin/python

import math

t = int(raw_input())
ct = 1
def isPerfect( n ) :
	p = math.sqrt( n )
	if( p % 1 == 0 ) :
		return True
	else :
		return False

while( ct <= t ) :
	n = int(raw_input())
	v = 5*n*n
	v2 = v + 4
	v3 = v - 4
	if( isPerfect( v2) or isPerfect( v3 ) ) :
		print 'Yes'
	else :
		print 'No'
	ct += 1