mod = 10**9 + 7

def matmul(A, B):
    Ah, Bh, Bw = len(A), len(B), len(B[0])
    C = [[0 for _ in range(Bw)] for _ in range(Ah)]
    for i in range(Ah):
        for j in range(Bw):
            for k in range(Bh):
                C[i][j] += A[i][k] * B[k][j]
                C[i][j] %= mod
    return C

# Mのk乗を効率的に計算する
def doubling(M, k):
    k -= 1
    Mc = M.copy()
    while k > 0:
        if k & 1 == 1:
            Mc = matmul(Mc, M)
        M = matmul(M, M) # Mの(2のi乗)の乗 を計算する
        k >>= 1
    return Mc

A = [[1, 0, 0, 0, 1, 1],
     [0, 1, 0, 1, 0, 1],
     [0, 0, 1, 1, 1, 0],
     [3, 0, 0, 0, 0, 0],
     [0, 3, 0, 0, 0, 0],
     [0, 0, 3, 0, 0, 0]]
F = [1, 0, 0, 3, 0, 0]
fraction = pow(3, mod - 2, mod)

t = int(input())
for _ in range(t):
    n = int(input())
    if n == 1:
        print(fraction)
    else:
        M = doubling(A, n)
        ans = 0
        for i in range(6):
            ans += M[3][i] * F[i]
            ans %= mod
        ans *= pow(fraction, n + 1, mod)
        ans %= mod
        print(ans)