MOD = 1000000007

N = int(raw_input().rstrip())


def zero(R, C):
    return [[0] * C for i in range(R)]


def eye(n):
    A = zero(n, n)
    for i in range(n):
        A[i][i] = 1
    return A


I = eye(10)

A = [[1, 1, 1, 0, 0, 0,  1, 0,  0, 1],  # 0..
     [1, 1, 1, 1, 1, 0,  0, 0,  0, 1],  # 01.
     [1, 1, 1, 1, 1, 1,  0, 1,  0, 1],  # 012
     [0, 1, 1, 1, 1, 0,  0, 0,  0, 1],  # .1.
     [0, 1, 1, 1, 1, 1,  0, 0,  0, 1],  # .12
     [0, 0, 1, 0, 1, 1,  1, 0,  0, 1],  # ..2
     [0, 0, 1, 0, 0, 0,  1, 0,  0, 0],  # 0.2 <closed>
     [1, 0, 0, 0, 0, 1,  0, 1,  0, 1],  # 0.2 <open>

     [1, 1, 1, 1, 1, 1,  1, 0,  1, 0],  # stop here
     [0, 0, 0, 0, 0, 0,  0, 0,  0, 1]]  # start here


def mul(A, B):
    R, C, X = len(A), len(B[0]), len(B)
    # assert len(A[0]) == len(B)
    D = zero(R, C)
    for r in range(R):
        for c in range(C):
            k = 0
            for i in range(X):
                k += A[r][i] * B[i][c]
            D[r][c] = k % MOD
    return D


def mul1(A, b):
    Ab = mul(A, [[bi] for bi in b])
    return [r[0] for r in Ab]


def pow(A, n):
    if n == 0:
        return I
    elif n == 1:
        return A
    B = pow(mul(A, A), n/2)
    if n % 2 == 1:
        B = mul(B, A)
    return B


X = pow(A, N+1)

# for r in X: print r
x = mul1(X, [0, 0, 0, 0, 0, 0, 0, 0, 0, 1])
# print "x=", x, sum(x[:7]) % MOD

print x[8] % MOD