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
from array import *
t = int(raw_input())
ct = 1
n = 10001
A = [0]*n
A[ 1 ] = 2
A[ 2 ] = 3
for i in range( 3, n ) :
	A[ i ] = A[ i - 1 ] + A[ i - 2 ]

while ( ct <= t ) :
	v = int(raw_input())
	print A[ v ]
	ct += 1