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

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