M = 1000000007

# qiita.com/SaitoTsutomu/items/be069ea89c85191799fa
def fib2(n):
    if n <= 1:
        return n
    result = [1, 0, 0, 1]
    matrix = [1, 1, 1, 0]
    while n > 0:
        if n % 2:
            result = mul(matrix, result)
        matrix = mul(matrix, matrix)
        n //= 2
    return result[2]

def mul(a, b):
    return [a[0]*b[0] % M + a[1]*b[2] % M,
            a[0]*b[1] % M + a[1]*b[3] % M,
            a[2]*b[0] % M + a[3]*b[2] % M,
            a[2]*b[1] % M + a[3]*b[3] % M]
            
n = int(input())
ans = fib2(n) * fib2(n+1) % M
print(ans)