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
dp0 = [0]*10001
dp1 = [0]*10001
def pre():
	dp0[1] = int(1)
	dp1[1] = int(1)
	for i in range(2,10001):
		dp1[i] = int(dp0[i-1]) + int(dp1[i-1])
		dp0[i] = int(dp1[i-1])

pre()
t = input()
for i in range(0,int(t)):
	n = int(input())
	print dp0[n]+dp1[n]