Fibonacci Membership Check

Given an integer N, determine if it is a member of the Fibonacci series. Return true if the number is a member of the Fibonacci series, otherwise return false.

Fibonacci Series Definition:

F(n) = F(n-1) + F(n-2)

Where F(0) = 0 and F(1) = 1.

Input:

Integer N

Output:

true or false

Example:

Input:

8

Output:

true

Explanation:

8 is a Fibonacci number (as F(6) = 8).

Constraints:

• 0 <= n <= 10^4