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
    
def e1(a, b, c, i):
    global tmin
    s = sum((a, b, c))
    if i < 0:
        if s < tmin : tmin = s
        return
    if s > tmin : return
    j = i-1
    e2(a*l[i], b, c, j)

def e2(a, b, c, i):
    global tmin
    s = sum((a, b, c))
    if i < 0:
        if s < tmin : tmin = s
        return
    if s > tmin : return
    j = i-1
    e2(a*l[i], b, c, j)
    e3(a, b*l[i], c, j)

def e3(a, b, c, i):
    global tmin
    s = sum((a, b, c))
    if i < 0:
        if s < tmin : tmin = s
        return
    if s > tmin : return
    j = i-1
    e3(a*l[i], b, c, j)
    e3(a, b*l[i], c, j)
    e3(a, b, c*l[i], j)

tmin = 0
N = int(input())
p = f(N)
if len(p) > 3:
    tmin = N - 1
    b = 1
    while b:
        b = 0
        l = []
        for i in set(p):
            if p.count(i) > 3:
                l += [i]*(p.count(i)-2)
                l += [i*i]
                b = 1
            else:
                l += [i]*(p.count(i))
        p = l
    e1(1, 1, 1, len(p)-1)
    print(tmin-3, N-1)
else:
    print(sum(p)-len(p), N-1)