A Lucas Number is a number which is represented by the following recurrence
Ln = Ln-1 + Ln-2 for n>1
L0 = 2
L1 = 1
Now given a number n your task is to find the nth lucas number.
Note: Since the output could be very long take mod 1000000007
The first line of input contains an integer T denoting the no of test cases. Then T test cases follow. Each line contains an integer n.
For each test case in a new line print the nth lucas no.