BETA

Difficulty Level: Easy

Submissions: 1135 Accuracy:

33.48%

Lucas Number
       

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

Input:
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.

Output:
For each test case in a new line print the nth lucas no.

Constraints:
1<=T<=100
1<=N<=100


Example:
Input:

2
9
3

Output:
76
4

 

** For More Input/Output Examples Use 'Expected Output' option **

Set Default Code

					   
It is recommended to 'Compile & Test' your code before clicking 'Submit'!

Compilation/Execution Result:

Need help with your code? Please use ide.geeksforgeeks.org, generate link and share the link here.