import sys
input = sys.stdin.readline

mod=10**9+7

# 行列の計算(numpyを使えないとき,modを使用)
def prod(A,B,k,l,m):# A:k*l,B:l*m
    C=[[None for i in range(m)] for j in range(k)]

    for i in range(k):
        for j in range(m):
            ANS=0
            for pl in range(l):
                ANS=(ANS+A[i][pl]*B[pl][j])%mod

            C[i][j]=ANS

    return C

def plus(A,B,k,l):# a,B:k*l
    C=[[None for i in range(l)] for j in range(k)]

    for i in range(k):
        for j in range(l):
            C[i][j]=(A[i][j]+B[i][j])%mod

    return C

# 漸化式を行列累乗で求める(ダブリング)

n=int(input())
s=pow(6,mod-2,mod)
POWA=[[[0,0,0,0,0,s],[1,0,0,0,0,s],[0,1,0,0,0,s],[0,0,1,0,0,s],[0,0,0,1,0,s],[0,0,0,0,1,s]]]

for i in range(60):
    POWA.append(prod(POWA[-1],POWA[-1],6,6,6)) # ベキを求めて

X=[[0,0,0,0,0,1]]
while n:
    X=prod(X,POWA[n.bit_length()-1],1,6,6) # n乗の場合
    n-=1<<(n.bit_length()-1)

print(X[0][-1])