def f(n):
    l = []
    c = 2
    a = 0
    while c * c <= n:
        if n % c == 0:
            n //= c
            l += [c]
        else:
            c += 1 + a
            a = 1
    if n > 1 : l += [n]
    return l

N = int(input())
p = f(N)
if len(p) > 3:
    p = sorted(p)
    q = p[-3:]
    for i in range(len(p)-3):
        p = sorted(p)
        q = sorted(q)
        q[0] *= p[0]
        p = p[1:]
    p = q
print(sum(p)-len(p), N-1)