def mat_mul(a, b):
    res = [[0] * len(b[0]) for _ in range(len(a))]
    for i in range(len(a)):
        for j in range(len(b[0])):
            for k in range(len(b)):
                res[i][j] = (res[i][j] + a[i][k] * b[k][j]) % MOD
    return res


def mat_pow(m, k):
    res = [[0] * len(m) for _ in range(len(m))]
    for i in range(len(m)):
        res[i][i] = 1
    while k:
        if k & 1:
            res = mat_mul(res, m)
        m = mat_mul(m, m)
        k >>= 1
    return res

MOD=10**9+7
n=int(input())

def fib(n):
    X=[[1],
       [0]]
    T=[[1,1],
       [1,0]]
    res=mat_pow(T,n-1)
    res=mat_mul(res,X)
    return res[0][0]

print(fib(n)*fib(n+1)%MOD)