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

见题面

见题面