FRS2 - Fibonaccibonacci (easy)

斐波那契数列第n项 $F(n)$ . 求 $F(F(n))$ . 答案对 $1e9+7$ 取模。

Leo would like to play with some really big numbers, OK... Let FIB the Fibonacci function : FIB(0)=0 ; FIB(1)=1 and for N>=2 FIB(N) = FIB(N-1) + FIB(N-2) Example : we have FIB(6)=8, and FIB(8)=21, so FIB(FIB(6))=21

The input begins with the number T of test cases in a single line. In each of the next T lines there are an integer N.

For each test case, print FIB(FIB(N)) , as the answer could not fit in a 64bit container, give your answer modulo 1000000007.

3
0
5
6

0
5
21