import sys

def main():
    sys.setrecursionlimit(1 << 25)
    L = int(sys.stdin.readline().strip())

    max_L = 3 * 10**6
    fib = [0] * (max_L + 1)
    fib[0] = 0
    fib[1] = 1
    for i in range(2, max_L + 1):
        fib[i] = fib[i-1] + fib[i-2]
        fib[i] %= 10**18 + 3

    if L % 2 == 1:
        cost = L
        ways = fib[L]
    else:
        half = L // 2
        total = fib[L]
        invalid = fib[half] * fib[half]
        valid_ways = total - invalid
        if valid_ways <= 0:
            print("INF")
            print(0)
            return
        cost = L
        ways = valid_ways

    print(cost)
    print(ways)

if __name__ == "__main__":
    main()