L = int(input())

if L == 0:
    print("INF")
    print(0)
    exit()

# Compute Fibonacci numbers up to L
max_fib = L
fib = [0] * (max_fib + 2)
fib[0] = 0
if max_fib >= 1:
    fib[1] = 1
for i in range(2, max_fib + 1):
    fib[i] = fib[i-1] + fib[i-2]

if L % 2 == 1:
    # Odd case
    min_cost = L
    pattern = fib[L]
    print(min_cost)
    print(pattern)
else:
    # Even case
    if L < 2:
        print("INF")
        print(0)
        exit()
    # Check if there are any valid compositions
    total = fib[L]
    half = L // 2
    if half > L:
        subtract = 0
    else:
        subtract = fib[half] ** 2
    valid = total - subtract
    if valid <= 0:
        print("INF")
        print(0)
    else:
        print(L)
        print(valid)