def solve(L):
    if L == 1:
        return 1, 1
    elif L == 2:
        return 3, 'INF'  # 1を2つ買ってきて、そのうち1つを r, 1-r の長さに切り、r, 1, 1-r の順に並べる。
    elif L & 1:
        return L, fib(L)
    else:
        return L, 2 * fibfib(L//2)


def fib(L):
    '''a1 = fib(2*k), a0 = fib(2*k-1)
    '''
    k = (L + 1) // 2
    a1, a0 = 0, 1
    p1, p0 = 1, 1
    while k:
        if k & 1:
            ac = a1 * p1
            a1 = ac + a1*p0 + a0*p1
            a0 = ac + a0*p0
        p2 = p1 * p1
        p1 = p2 + 2*p1*p0
        p0 = p2 + p0*p0
        k >>= 1
    if L & 1:
        return a0
    else:
        return a1


def fibfib(m):
    '''
    m = 2 * k + 1 or
    m = 2 * k
    a1 = fib(2*k), a0 = fib(2*k-1)
    '''
    k = m // 2
    a1, a0 = 0, 1
    p1, p0 = 1, 1
    while k:
        if k & 1:
            ac = a1 * p1
            a1 = ac + a1*p0 + a0*p1
            a0 = ac + a0*p0
        p2 = p1 * p1
        p1 = p2 + 2*p1*p0
        p0 = p2 + p0*p0
        k >>= 1
    if m & 1:
        return a1 * (a1 + a0)
    else:
        return a1 * a0
    
L = int(input())
cost, n_pat = solve(L)
print(cost)
print(n_pat)