1198 : Fibonacci Cane

Description

Bob likes Fibonacci numbers too much. When he buys sugar canes, he hopes that the length of the sugar cane is a continuous sum of Fibonacci sequence.

Fibonacci sequence is a sequence that: \(f_{0}=1, f_{1}=1,\dots , f_{n}=f_{n-1}+f_{n-2}\).

He asks you to help determine whether a sugar cane is what he wants.

Input

No more than 1000 test cases. Each case contains a positive integer n, the length of a sugar cane.

\(1 \leq n \leq 10^{15}\)

Output

Output YES if the length is a continuous sum of the Fibonacci sequence, otherwise output NO.

Sample

1
2
5
9
10

YES
YES
YES
NO
YES

Hint

Source

Author

CSGrandeur