n = int(input())
divs = []

for i in range(1, int(n ** 0.5 + 1)):
    if n % i == 0:
        divs.append(i)
        if i != n // i:
            divs.append(n // i)
divs.sort()
l = len(divs)
double = [0] * l
for i, d in enumerate(divs):
    double[i] = d - 1
    for j, d2 in enumerate(divs[:i]):
        if d % d2 == 0:
            double[i] = min(double[i], d2 + d // d2 - 2)

ans = n - 1
dic = {d:i for i, d in enumerate(divs)}
for d in divs:
    ans = min(ans, d - 1 + double[dic[n // d]])
print(ans, n - 1)