Our Chef is doing what he is best at, COOKING A BARBECUE for his guests. He has invited all of us, and taking the help of his apprentice to smoke the barbecues. The chef has got BBQ sticks, each can take N fillings, and he presents N distinctly filled sticks in front his guests forming a N*N  matrix

But here is the problem, he has got only two type of fillings, meat and capsicum, but still wants the N  sticks to look "presentable", he is very particular about it. As a solution he fills the main diagonal of the N*N  matrix with the same type of filling (either meat or capsicum) forming a "presentable" set

The Chef's apprentice is a fool, so the Chef asks him to cook M distinctly filled sticks ,so that the Chef is sure that among M there exist N sticks forming a "presentable" set. Your job is to determine smallest possible value of M.


-----Input-----
T, the number of test cases, followed by T lines. 
Each line containing the positive integer N >= 4

-----Output-----
T lines of output, each line contain the positive integer M

-----Example-----
Input:
1
4

Output:
5

Source: codechef | Difficulty: UNKNOWN_DIFFICULTY


Solutions:
testcase = int(input())
for case in range(testcase):
	n = int(input())
	print(2 ** (n - 2) + 1)
	print('\n')


N = eval(input())
for t in range(N):
	print(2 ** (eval(input()) - 2) + 1)


tc = int(input())
while tc:
	tc -= 1
	n = int(input())
	ans = 2 ** (n - 2)
	ans += 1
	print(ans)


import sys
t = int(sys.stdin.readline())
for _ in range(t):
	n = int(sys.stdin.readline())
	print((1 << n - 2) + 1)


t = int(input())
while t:
	n = int(input())
	k = 2 ** (n - 2) + 1
	print(k)
	t = t - 1


import math
n = int(input())
while n > 0:
	a = int(input())
	print(1 + pow(2, a - 2))
	n = n - 1


T = eval(input())
for t in range(T):
	N = eval(input())
	print(pow(2, N - 2) + 1)


import sys
T = int(sys.stdin.readline().strip())
while T > 0:
	n = int(sys.stdin.readline().strip())
	m = 2 ** (n - 2) + 1
	print(m)
	T = T - 1


n = int(input(''))
while n:
	k = int(input(''))
	k = k - 2
	fact = 2 ** k
	fact = fact + 1
	n = n - 1
	print(fact)


t = eval(input())
while t:
	t -= 1
	n = eval(input())
	n -= 2
	print(2 ** n + 1)


t = eval(input())
for i in range(1, t + 1):
	n = eval(input())
	ans = pow(2, n - 2) + 1
	print(ans)


import math
t = eval(input())
for i in range(1, t + 1):
	n = eval(input())
	n = n - 2
	result = pow(2, n) + 1
	print(result)