MOD = 10**9 + 7

def fib(n):
    def fib_pair(n):
        if n == 0:
            return (0, 1)
        a, b = fib_pair(n >> 1)
        c = a * ((2 * b - a) % MOD)
        d = (a * a + b * b) % MOD
        if n & 1:
            return (d, (c + d) % MOD)
        else:
            return (c, d)
    return fib_pair(n)[0]

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