mod = 10 ** 9 + 7
P = 333333336


def mat_mul(A, B):
    res = [[0] * len(B[0]) for _ in range(len(A))]
    for i in range(len(A)):
        for k in range(len(A[0])):
            for j in range(len(B[0])):
                res[i][j] += A[i][k] * B[k][j]
                res[i][j] %= mod
    return res


def mat_pow(A, n):
    size = len(A)
    res = [[0] * size for _ in range(size)]
    for i in range(size):
        res[i][i] = 1
    while n:
        if n & 1:
            res = mat_mul(res, A)
        A = mat_mul(A, A)
        n >>= 1
    return res


A = [[0] * 9 for _ in range(9)]
for i in range(0, 9, 3):
    A[i][i] = P
    A[i+1][i] = P
    A[i+2][i] = P

    A[(i+3) % 9][i+1] = 1
    A[(i+6) % 9][i+2] = 1

T = int(input())
for _ in range(T):
    N = int(input())
    B = mat_pow(A, N)
    print(B[0][0])