Today, as usual, Jerry comes up with a new puzzle for Tom. Jerry knows very well that Tom is well aware of the concepts of fibonacci series. So he intends to present the problem with a twist. By choosing any random integer Jerry asks Tom to tell whether the given number is a fibonacci number.

Input

The first line of the input contains an integer T denoting the number of test cases.
Next T lines which contain a random number N chosen by Jerry.

Output

For each input random integer you need to tell if the integer is fibo number or not. If the integer is fibo number output "is fibo" otherwise output "not fibo".

Constraints

1 ≤ T ≤ 20
1 ≤ N ≤ 1*10^9

Example
Input:
3
1
3
7

Output:
is fibo
is fibo
not fibo

见题面

见题面