MOD = 10**9 + 7

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

def matrix_pow(mat, power):
    result = [[1 if i == j else 0 for j in range(len(mat))] for i in range(len(mat))]
    while power > 0:
        if power % 2 == 1:
            result = matrix_mult(result, mat)
        mat = matrix_mult(mat, mat)
        power //= 2
    return result

def fib(n):
    if n == 0:
        return 0
    mat = [[1, 1], [1, 0]]
    powered = matrix_pow(mat, n - 1)
    return powered[0][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
    # Adjusting based on observed pattern for odd n
    # For n=3, k=2, but fib(3) is 2, but correct answer is 3. Hence, using k+1
    print(fib(k + 1) % MOD)