MOD = 10**9 + 7

max_n = 3000000  # As per problem statement

# Precompute Fibonacci numbers modulo MOD
f = [0] * (max_n + 1)
f[1] = 1
if max_n >= 2:
    f[2] = 1
for i in range(3, max_n + 1):
    f[i] = (f[i-1] + f[i-2]) % MOD

L = int(input())

if L == 0:
    print("INF")
    print(0)
else:
    if L % 2 == 1:
        print(L)
        print(f[L] % MOD)
    else:
        print(L)
        half = L // 2
        a = f[L] % MOD
        b = f[half] % MOD
        ways = (a - (b * b) % MOD) % MOD
        print(ways)