def mat_mul(A, B):
    mod = 10 ** 9 + 7
    res = [[0]*6 for _ in range(6)]
    for i in range(6):
        for k in range(6):
            for j in range(6):
                res[i][j] += A[i][k] * B[k][j]
                res[i][j] %= mod
    return res


def mat_pow(A, n):
    mod = 10 ** 9 + 7
    res = [[0] * 6 for _ in range(6)]
    for i in range(6):
        res[i][i] = 1
    while n:
        if n & 1:
            res = mat_mul(res, A)
        A = mat_mul(A, A)
        n >>= 1
    return res


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

p = [1]
for i in range(5):
    tmp = sum(p) * pow(6, mod - 2, mod) % mod
    p.append(tmp)
if N < 6:
    print(p[N])
    exit()


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

An = mat_pow(A, N - 5)
ans = 0
for i in range(6):
    ans += p[i] * An[0][i]
    ans %= mod

print(ans)