11541 - Fibonacci number   

Description

The  Fibonacci sequence are the numbers in the following intergur sequence:

0,\;1,\;1,\;2,\;3,\;5,\;8,\;13,\;21,\;34,\;55,\;89,\;144,\; \ldots\; In mathematical terms, the sequence Fn of Fibonacci numbers is defined by the first two numbers in the Fibonacci sequence are  0 and 1, and each subsequent number is the sum of the previous two.

F_n = F_{n-1} + F_{n-2},\!\,       

F_0 = 0,\; F_1 = 1.

You should enter an index of Fibonacci sequence ,and then output a Fibonacci numbers of this index

Input

First line contains an integer t, which indicates the number of test cases in the input. In the next t lines, each line contains an index of Fibonacci sequence

Output

For each case, output is a non-negative integer Fibonacci numbers of this index in a line.

Sample Input  Download

Sample Output  Download

Tags




Discuss