Fibonacci

Time Limit: 2000/1000 MS (Java/Others)

Memory Limit: 65536/65536 K (Java/Others)

Description

Following is the recursive definition of Fibonacci sequence:
$$
F_i=
\begin{cases}
0& \text{i = 0} \\
1& \text{i = 1} \\
F_{i-1} + F_{i-2}& \text{i > 1}
\end{cases}
$$
Now we need to check whether a number can be expressed as the product of numbers in the Fibonacci sequence.

Input

There is a number \(T\) shows there are \(T\) test cases below. ($T \leq 100,000$)
For each test case , the first line contains a integers n , which means the number need to be checked.
$0 \leq n \leq 1,000,000,000$

Output

For each case output "Yes" or "No".

Sample Input

3 4 17 233

Sample Output

Yes No Yes

Hint

hujie

Source

BestCoder Round #28

提交代码