MOD = 10**9 + 7

def sum_fib_squares(n):
    def fast_doubling(m):
        if m == 0:
            return (0, 1)
        a, b = fast_doubling(m // 2)
        c = (a * (2 * b - a)) % MOD
        d = (a * a + b * b) % MOD
        if m % 2 == 0:
            return (c, d)
        else:
            return (d, (c + d) % MOD)
    
    fib_n, fib_n_plus_1 = fast_doubling(n)
    return (fib_n * fib_n_plus_1) % MOD

n = int(input())
print(sum_fib_squares(n))