import math
N = int(input())

def divisors2(num):
    divs = []
    for n in range(1, int(math.sqrt(num)) + 1):
        if num % n == 0:
            divs.append(n)
    return divs

def divisors3(num):
    divs = []
    for n in range(1, math.ceil(math.pow(num, (1.0/3.0))) + 1):
        if num % n == 0:
            divs.append(n)
    return divs

div2 = divisors2(N)
div3 = divisors3(N)
ans = float('inf')
for i in div3:
    for j in div2:
        if N % (i * j) == 0:
            k = N // (i * j)
            ans = min(ans, i + j + k - 3)

print(ans, N-1)