import sys
input = lambda :sys.stdin.readline()[:-1]
ni = lambda :int(input())
na = lambda :list(map(int,input().split()))
sys.setrecursionlimit(10**7)
yes = lambda :print("yes");Yes = lambda :print("Yes");YES = lambda : print("YES")
no = lambda :print("no");No = lambda :print("No");NO = lambda : print("NO")
#######################################################################



#a*bの計算
def mat_mul(a,b):
    n,m,l=len(a),len(b[0]),len(b)
    c=[[0]*m for _ in range(n)]
    for i in range(n):
        for k in range(l):
            for  j in range(m):
                c[i][j]=(c[i][j]+a[i][k]*b[k][j])%mod
    return c
 
#a^nの計算
def mat_pow(a,n):
    m=len(a)
    b=[[0]*m for _ in range(m)]
    for i in range(m):
        b[i][i]=1
    while n>0:
        if n&1:
            b=mat_mul(b,a)
        a=mat_mul(a,a)
        n>>=1
    return b



t = ni()
p = mod = 10**9+7
z = pow(3,p-2,p)
s = list(zip([z,0,0,1,0,0]))
b = [[z,0,0,0,z,z],
     [0,z,0,z,0,z],
     [0,0,z,z,z,0],
     [1,0,0,0,0,0],
     [0,1,0,0,0,0],
     [0,0,1,0,0,0]]

for n in [ni() for i in range(t)]:
    if n==1:
        print(z)
    else:
        print(mat_mul(mat_pow(b,n-1),s)[0][0]%mod)