This one has the smallest write-up , but then too Puttan got caught in that.

He has to find the number of ways of representing a number as a sum of 1s and 2s only.
Two ways are considered different even if they differ in position.
For example - There are 3 representations of number 3 - (1,1,1), (1,2) and (2,1).
Note that (1,2) and (2,1) are considered different.

Help Puttan !

INPUT:
First line contains T , the number of test cases Each test case contains an Integer N whose no. of desired compositions is to be found.

CONSTRAINTS:
1 ≤ T ≤ $10^{5}$
1 ≤ N ≤ $10^{9}$

OUTPUT:
For each test case Print the answer mod ($10^{9}$+7) in a new line