Problem hidden
This problem was hidden by Editorial Board member probably because it has incorrect language
version or invalid test data, or description of the problem is not clear.
SPOJ Problem Set (main)
5642. Fibonacci numbers
Problem code: FIBON

You are given number n and your task is to calculate nth Fibonacci number.
Input
The first line of the standard input contains one integer t (t<101) which is number of test cases.
In each of the next t lines there is one number n (n<71).
Output
For every test case print one number which is nth Fibonacci number.
Example
Input:
2 10 20
Output:
55 6765
