MOD = 10**9 + 7

def fib(n, mod):
    if n == 0:
        return 0
    def multiply(a, b):
        return (
            (a[0]*b[0] + a[1]*b[2]) % mod,
            (a[0]*b[1] + a[1]*b[3]) % mod,
            (a[2]*b[0] + a[3]*b[2]) % mod,
            (a[2]*b[1] + a[3]*b[3]) % mod
        )
    
    def matrix_pow(mat, power):
        result = (1, 0, 0, 1)  # Identity matrix
        while power > 0:
            if power % 2 == 1:
                result = multiply(result, mat)
            mat = multiply(mat, mat)
            power //= 2
        return result
    
    mat = matrix_pow( (1, 1, 1, 0), n-1 )
    return mat[0]

n = int(input())
if n == 1:
    print(1)
elif n % 2 == 0:
    k = n // 2 + 1
    print(fib(k, MOD))
else:
    k = (n - 1) // 2 + 3
    print(fib(k, MOD))