import sys

sys.setrecursionlimit(200005)
int1 = lambda x: int(x)-1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.buffer.readline())
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def LI1(): return list(map(int1, sys.stdin.buffer.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def BI(): return sys.stdin.buffer.readline().rstrip()
def SI(): return sys.stdin.buffer.readline().rstrip().decode()
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
dij = [(0, 1), (1, 0), (1, 1), (1, -1)]
inf = 10**16
# md = 998244353
md = 10**9+7

p = 166666668

n = II()

xx = [1]*6
for i in range(1, 6):
    xx[i] = sum(xx[j]*p%md for j in range(i))%md

if n < 6:
    print(xx[n])
    exit()

def dot(aa, bb):
    return [[sum(a*b%md for a, b in zip(row, col))%md for col in zip(*bb)] for row in aa]

n -= 5

base = [[0, 0, 0, 0, 0, p],
        [1, 0, 0, 0, 0, p],
        [0, 1, 0, 0, 0, p],
        [0, 0, 1, 0, 0, p],
        [0, 0, 0, 1, 0, p],
        [0, 0, 0, 0, 1, p]]
cc = [[1 if i == j else 0 for j in range(6)] for i in range(6)]

while n:
    if n & 1: cc = dot(cc, base)
    base = dot(base, base)
    n >>= 1

[xx] = dot([xx], cc)
print(xx[-1])