A regular octagon with vertices X1, X2,..., X8 is provided. A frog starts jumping from the vertex X1. It may jump to any of the two adjacent vertices in one jump except from X5. When it reaches X5, it stops and stays there. Let P(n) be the number of distinct paths of exactly n jumps ending at X5. Given the value of n, you need to print the value of P(n).


Input
 The first line of the input contains the number of test cases T, at most 100. Each of the next T lines contain a single integer N, where 1 ≤ N ≤ 100.


Output
For each value of N in the input, print on a new line the number of distinct paths of exactly n jumps ending at X5.


Example

Input:
3
1
2
4

Output:
0
0
2
a=[]
i=2
a.insert(0,0)
a.insert(1,2)
while i<101:
    n=4*a[i-1]-2*a[i-2]
    a.append(n)
    i=i+1
#def f(n):
#   if n == 0:
#       return 0
#   elif n == 1:
#       return 2
#   else:
#       return 4*f(n-1) -2*f(n-2)
t=input()
i=0
while i<t:
    n=input()
    if n%2==0:
    	n=n/2-1
    	print a[n]
    else:
	print "0"
    i=i+1