#!/usr/bin/env python3
import numpy as np

def powmod(f, n, mod):
    g = np.identity(4, dtype=np.uint64)
    for p in map(int, reversed(bin(n)[2 :])):
        if p:
            g = g * f % mod
        f = f * f % mod
    return g

def solve(n):
    # \begin{pmatrix} F_{i+1}^2 \\ F_{i+1} F_i \\ F_i^2 \\ \sum_{j \le i} F_j^2 \end{pmatrix}
    x = np.matrix([ 1, 0, 0, 0 ], dtype=np.uint64).transpose()
    f = np.matrix([
        [ 1, 2, 1, 0 ],
        [ 1, 1, 0, 0 ],
        [ 1, 0, 0, 0 ],
        [ 1, 0, 0, 1 ],
    ], dtype=np.uint64)
    mod = 10 ** 9 + 7
    return (powmod(f, n, mod) * x % mod)[3, 0]

print(solve(int(input())))