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₀ = 1, f₁ = 1, …, 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 ≤ n ≤ 10¹⁵

Output

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

1
2
5
9
10

YES
YES
YES
NO
YES