#!/usr/bin/python3
# †
mod = 10**9 + 7

def mod_inv(a, m):
    b, s, t, old_a = m, 1, 0, a
    while b:
        q = a // b
        a %= b
        a, b = b, a
        s -= t * q
        s, t = t, s
    if a != 1:
        print('Error: {}**(-1) mod {} does not exist.'.format(old_a, m))
        return None
    return s + m if s < 0 else s


def matmul(A, B):
    p, q = len(A[0]), len(B)
    if p != q:
        raise ValueError('len(A[0])={} len(B)={}'.format(p, q))
    rows, cols, times = len(A), len(B[0]), len(A[0])
    res = [[0] * cols for _ in range(rows)]
    for r in range(rows):
        for c in range(cols):
            res[r][c] = sum(A[r][i]*B[i][c] % mod for i in range(times))
            res[r][c] %= mod
    return res


def matpow(A, n):
    m = len(A)
    res = [[int(i==j) for j in range(m)] for i in range(m)]
    while n > 0:
        if n & 1:
            res = matmul(res, A)
        A = matmul(A, A)
        n >>= 1
    return res


###
if __name__ == '__main__':
    n = int(input())
    x = mod_inv(6, mod)
    A = [
        [x, x, x, x, x, x],
        [1, 0, 0, 0, 0, 0],
        [0, 1, 0, 0, 0, 0],
        [0, 0, 1, 0, 0, 0],
        [0, 0, 0, 1, 0, 0],
        [0, 0, 0, 0, 1, 0],
    ]
    R = matpow(A, n)
    res = R[0][0]
    print(res)