import sys
input = sys.stdin.readline
from collections import *

def f(x, y):
    return x*pow(y, MOD-2, MOD)%MOD
    
def mat_mul(A, B):
    C = [[0]*len(B[0]) for _ in range(len(A))]
    
    for i in range(len(A)):
        for j in range(len(B[0])):
            for k in range(len(A[0])):
                C[i][j] += A[i][k]*B[k][j]
                C[i][j] %= MOD
    
    return C

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

N = int(input())
MOD = 10**9+7
x = [[-1] for _ in range(6)]
x[0][0] = f(1, 6)
x[1][0] = f(7, 6**2)
x[2][0] = f(7**2, 6**3)
x[3][0] = f(7**3, 6**4)
x[4][0] = f(7**4, 6**5)
x[5][0] = f(7**5, 6**6)
A = [[0]*6 for _ in range(6)]

for i in range(6):
    A[0][i] = f(1, 6)

for i in range(1, 6):
    for j in range(6):
        for k in range(i):
            A[i][j] += f(1, 6)*A[k][j]
            A[i][j] %= MOD
    
        if j>=i:
            A[i][j] += f(1, 6)
            A[i][j] %= MOD

c = (N-1)//6
res = mat_mul(mat_pow(A, c), x)
print(res[(N-1)%6][0])