1015: 湖南省第十八届大学生计算机程序设计竞赛(HNCPC2022) - Semilive

开始 Start
0000-00-0000:00:00UTC+0
结束 End
0000-00-0000:00:00UTC+0
当前 Now
0000-00-0000:00:00UTC+0
状态 Status
加载中Loading
类型 Type
开放Public
榜单 Rank
加载中Loading
公告 Announcement
暂无公告No announcement

J : Fibonacci Cane

时间限制Time Limit
1 秒Sec
内存限制Memory Limit
128 兆MB
提交次数Submitted
336 次Times
通过次数Solved
147 次Times

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