import sys

sys.setrecursionlimit(10 ** 6)
from bisect import *
from collections import *
from heapq import *

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

def main():
    def fac(n):
        res=[]
        for d in range(1,n+1):
            if d**2>n:break
            if n%d==0:res.append(d)
        return res

    def cal(m):
        f=ff[m]
        n1=n//f
        for d in range(int(n1**0.5)+1,0,-1):
            if n1%d==0:return d+n1//d+f-3

    n=II()
    ff=fac(n)
    fn=len(ff)
    l=-1
    r=fn
    while l+2<r:
        m1=(l*2+r)//3
        m2=(l+r*2)//3
        if cal(m1)<cal(m2):r=m2
        else:l=m1
    print(cal((l+r)//2),n-1)

main()