def solve(L):
    if L == 1:
        return 1, 1
    elif L == 2:
        return 4, 1  # 3を買ってきて切る
    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):
    '''fib(m)*fib(m-1)
    '''
    if m == 1:
        return 0
    if m == 2:
        return 1  # fib(2)*fib(1) = 1
    a = 1
    b = 1
    for i in range(m - 2):
        a, b = a + b, a
    return a * b
    
L = int(input())
cost, n_pat = solve(L)
print(cost)
print(n_pat)