# yukicoder No.375 立方体のN等分 (1)

# nを素因数分解する関数
def prime_decomp(n):
    i = 3
    table = []

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

    while i * i <= n:
        while n % i == 0:
            n //= i
            table.append(i)
        i += 2

    if n > 1:
        table.append(n)
    return table

N = int(input())

div_N = prime_decomp(N)

cut = [1, 1, 1]

for i in div_N:
    cut[cut.index(min(cut))] *= i

T_min = sum(cut) - 3
T_max = N - 1

print(T_min, T_max)