Sprout Sequence

You are given a positive integer representing a month number. The growth pattern of a plant is such that the number of leaves at the end of month \(n\) is equivalent to the \(n\)th Fibonacci number, with the first two months both having 1 leaf. Specifically, the sequence is defined as:

\(F(1)=1,\quad F(2)=1,\quad F(n)=F(n-1)+F(n-2)\) for \(n > 2\).

Your task is to compute the number of leaves after a given month by calculating the corresponding Fibonacci number.

inputFormat

The input is read from stdin and consists of multiple test cases. The first line contains a single integer \(T\) indicating the number of test cases. Each of the following \(T\) lines contains one integer \(month\), representing the month number.

outputFormat

For each test case, output the number of leaves (i.e. the corresponding Fibonacci number) in a separate line to stdout.

## sample

3
1
5
10

1
5
55

</p>