Fibonacci number
Easy
Execution time limit is 2 seconds
Runtime memory usage limit is 128 megabytes
Fibonacci numbers are defined as follows:
F (1) = F (2) = 1
F (n) = F (n - 1) + F (n - 2) for n ≥ 3.
Calculate the n-th Fibonacci number.
Input
The first line specifies the number of test cases t (1 ≤ t ≤ 10^3
). Each of the following t lines contains a single number n (1 ≤ n ≤ 10^4
).
Output
For each test case output the corresponding Fibonacci number in a separate line.
Examples
Input #1
Answer #1
Submissions 2K
Acceptance rate 21%