Detect a Fib
In this problem, you're given a number, and must determine if it occurs in the Fibonacci sequence.
The first two numbers of the Fibonacci sequence are \(0\) and \(1\). All further values of the Fibonacci sequence are the sum of the previous two values. This means that the values after \(0\) and \(1\) are \(1, 2, 3, 5, 8, 13, \ldots\).
Input
The input consists of a single integer, \(0 \leq n \leq 10000\).
Output
The output consists of a single word. If the input \(n\) is in the Fibonacci sequence, then that word is Yes; otherwise, it is No.
Examples
Example 1
Input:
3
Output:
Yes
Example 2
Input:
4
Output:
No
Comments