import math

n = int(input())
maxt = n-1
prime = []

while n%2==0:
    n = n//2
    prime.append(2)

root_n = int(math.sqrt(n))
for i in range(3,root_n+1,2):
    while n%i==0:
        n = n//i
        prime.append(i)
    if i>n:
        break
prime.append(n)

xyz = [1,1,1]
for i in range(len(prime)):
    xyz[i%3] *= prime[i]
mint=0
for i in xyz:
    mint+=i-1
print(mint,maxt)