Little Raju recently learnt about binary numbers. After spending some time with it, he decided to count in how many ways he can make N digit numbers that is formed by ones and zeroes. But zeroes can not be next to each other. Help him finding in how many different numbers can he make?

Example: There 5  possible ways of making different numbers using 3 digit numbers i.e. 101,010,111,110,011

Input

First line of input contains the total number of test cases T.
Next T lines contain N as explained above.

Output

For each test case print  in newline as explained above.

Constraints

1 ≤ t ≤ 10
1 ≤ n ≤ 10^4

SAMPLE INPUT
2
3
7

SAMPLE OUTPUT
5
34
import math
def powLF(n):
    if n == 1:     return (1, 1)
    L, F = powLF(n//2)
    L, F = (L**2 + 5*F**2) >> 1, L*F
    if n & 1:
        return ((L + 5*F)>>1, (L + F) >>1)
    else:
        return (L, F)

def fib(n):
    if n & 1:
        return powLF(n)[1]
    else:
        L, F = powLF(n // 2)
        return L * F
t=int(raw_input())
while(t!=0):
	n=int(raw_input())
	print fib(n+2)
	t=t-1