n = int(input())
mod = 10**9+7

p = 1*pow(6,(mod-2),mod)%mod
#print(a)

p1 = p
p2 = (p + p1*p)%mod
p3 = (p + (p2+p1)*p)%mod
p4 = (p + (p3+p2+p1)*p)%mod
p5 = (p + (p4+p3+p2+p1)*p)%mod
p6 = (p + (p5+p4+p3+p2+p1)*p)%mod
P = [p1, p2, p3, p4, p5, p6]

if n <= 6:
    print(P[n-1])
    exit()

P.reverse()

# A*B
def mul(a, b):
    c = [[0]*len(b[0]) for i in range(len(a))]
    for i in range(len(a)):
        for k in range(len(b)):
            for j in range(len(b[0])):
                c[i][j] = (c[i][j] + a[i][k]*b[k][j])%mod

    return c

#A**n
def pow(a, n):
    b = [[0]*len(a) for i in range(len(a))]
    for i in range(len(a)):
        b[i][i] = 1
    while n > 0:
        if n & 1 == 1:
            b = mul(a, b)
        a = mul(a, a)
        n = n>>1
    return b

A = [[0]*6 for i in range(6)]
for i in range(6):
    A[0][i] = p
for i in range(1, 6):
    A[i][i-1] = 1

#print(A)

B =  pow(A, n-1)
#print(B)
ans = 0
for i in range(6):
    ans += B[5][i]*P[i]
    ans %= mod
#ans *= power(a, n-1, mod)
#ans %= mod
print(ans%mod)