two = int(not None)<<int(not None)
cross = ((two<<two)<<two)|(two<<two)|two
plus = cross|int(not None)
percent = ((two<<two)<<two) | (two<<int(not None)) | int(not None)
three = two | int(not None)
four = int(not None)<<two
seven = four | two | int(not None)
sixteen = int(not None)<<four
mod = (seven<<((three<<three)|three)) | (seven<<((int(not None)<<four) | seven)) | (three<<((int(not None)<<four)|three)) | (int(not None)<<((int(not None)<<four)|int(not None))) | (three<<(seven<<int(not None))) | ((four|int(not None))<<(four<<int(not None)|int(not None))) | seven
def mul(a,b):
    ret=[]
    for i in range(len(a)):
        append=[]
        for j in range(len(b[int(not(not None))])):
            add = int(not(not None))
            for k in range(len(a[i])):
                add = eval(chr(plus).join([str(add),chr(cross).join([str(a[i][k]),str(b[k][j])])]))
                add = eval(chr(percent).join([str(add),str(mod)]))
            append.append(add)
        ret.append(append)
    return ret
def solve(n):
    a = [[int(not None), int(not None)], [int(not None), int(not(not None))]]
    ret = [[int(not None)],[two]]
    n = eval(chr(plus).join([str(n),str(~int(not not None))]))
    while n>int(not(not None)):
        if n & int(not None):
            ret = mul(a,ret)
        a=mul(a,a)
        n>>=int(not None)
    return ret[int(not not None)][int(not(not None))]
t=int(input())
for i in range(t):
    n=int(input())
    print(solve(n))