from itertools import *
from bisect import *
from math import *
from collections import *
from heapq import *
from random import *
import numpy as np
import sys

sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def MI1(): return map(int1, sys.stdin.readline().split())
def MF(): return map(float, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LF(): return list(map(float, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
dij = [(1, 0), (0, 1), (-1, 0), (0, -1)]

def main():
    def div(x, lo):
        for d in range(lo, x):
            if d ** 2 > x:
                return -1
            if x % d == 0:
                return d

    n = II()
    lo1 = 1
    ans = 10 ** 16
    while 1:
        d1 = div(n, lo1)
        if d1 == -1: break
        lo1 = d1 + 1
        lo2 = d1
        while 1:
            d2 = div(n // d1, lo2)
            lo2 = d2 + 1
            if d2 == -1: break
            d3 = n // d1 // d2
            val = d1 + d2 + d3 - 3
            if val < ans: ans = val

    print(ans, n - 1)

main()