1198 : Fibonacci Cane

时间限制Time Limit 1 Sec 内存限制Memory Limit 128 MB 提交次数Submitted 1107 Times 通过次数Solved 555 Times 标准评测Standard Judge

题目描述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

出题Author

CSGrandeur