mod = int(1e9) + 7
vec = [1, 1, 7, 49, 343, 2401]
for i in range(6):
    vec[i] *= 6**(5-i)
def doubling(n, m):
    y = 1
    base = n
    tmp = m
    while tmp != 0:
        if tmp % 2 == 1:
            y *= base
            y %= mod
        base *= base
        base %= mod
        tmp //= 2
    return y
def inved(a):
    x, y, u, v, k, l = 1, 0, 0, 1, a, mod
    while l != 0:
        x, y, u, v = u, v, x - u * (k // l), y - v * (k // l)
        k, l = l, k % l
    return x % mod

def matprod(m1, m2, n, l, m):
    y = [[0 for _ in range(m)] for __ in range(n)]
    for i in range(n):
        for j in range(m):
            for k in range(l):
                y[i][j] += m1[i][k] * m2[k][j] % mod
                y[i][j] %= mod
    return y
    
def matpow(m1, n, m):
    y = [[i==j for j in range(n)] for i in range(n)]
    bas = [[m1[i][j] for j in range(n)] for i in range(n)]
    tmp = m
    while tmp != 0:
        if tmp % 2 == 1:
            y = matprod(y, bas, n, n, n)[:][:]
        bas = matprod(bas, bas, n, n, n)[:][:]
        tmp //= 2
    return y
    
N = int(input())
bas = [[0 for j in range(6)] for i in range(6)]
for i in range(5):
    bas[i][i+1] = 6
    bas[-1][i] = 1
bas[-1][-1] = 1
mat = matpow(bas, 6, N)
S = 0
for i in range(6):
    S += vec[i] * mat[0][i] % mod
    S %= mod
print(S*inved(doubling(6, N+5))%mod)