package main

import (
	"bufio"
	"fmt"
	"os"
	"sort"
	"strconv"
)

var sc = bufio.NewScanner(os.Stdin)
var wr = bufio.NewWriter(os.Stdout)

func out(x ...interface{}) {
	fmt.Fprintln(wr, x...)
}

func getI() int {
	sc.Scan()
	i, e := strconv.Atoi(sc.Text())
	if e != nil {
		panic(e)
	}
	return i
}

func getF() float64 {
	sc.Scan()
	i, e := strconv.ParseFloat(sc.Text(), 64)
	if e != nil {
		panic(e)
	}
	return i
}

func getInts(N int) []int {
	ret := make([]int, N)
	for i := 0; i < N; i++ {
		ret[i] = getI()
	}
	return ret
}

func getS() string {
	sc.Scan()
	return sc.Text()
}

// min, max, asub, absなど基本関数
func max(a, b int) int {
	if a > b {
		return a
	}
	return b
}

func min(a, b int) int {
	if a < b {
		return a
	}
	return b
}

// min for n entry
func nmin(a ...int) int {
	ret := a[0]
	for _, e := range a {
		ret = min(ret, e)
	}
	return ret
}

// max for n entry
func nmax(a ...int) int {
	ret := a[0]
	for _, e := range a {
		ret = max(ret, e)
	}
	return ret
}

func asub(a, b int) int {
	if a > b {
		return a - b
	}
	return b - a
}

func abs(a int) int {
	if a >= 0 {
		return a
	}
	return -a
}

func lowerBound(a []int, x int) int {
	idx := sort.Search(len(a), func(i int) bool {
		return a[i] >= x
	})
	return idx
}

func upperBound(a []int, x int) int {
	idx := sort.Search(len(a), func(i int) bool {
		return a[i] > x
	})
	return idx
}

type pair struct {
	a, b int
}

type cut struct {
	a, b, c int
}

func f(e pair) []cut {
	ret := make([]cut, 0)
	for i := 1; i*i <= e.a; i++ {
		if e.a%i == 0 {
			ret = append(ret, cut{i, e.a / i, e.b})
		}
	}
	for i := 1; i*i <= e.b; i++ {
		if e.b%i == 0 {
			ret = append(ret, cut{e.a, i, e.b / i})
		}
	}
	return ret
}

func main() {
	defer wr.Flush()
	sc.Split(bufio.ScanWords)
	sc.Buffer([]byte{}, 1000000)
	// this template is new version.
	// use getI(), getS(), getInts(), getF()
	N := getI()

	Tmax := N - 1
	Tmin := Tmax
	for i := 1; i*i*i <= N; i++ {
		if N%i == 0 {
			a := i
			n := N / i
			for j := i; j*j <= n; j++ {
				if n%j == 0 {
					b, c := j, n/j
					Tmin = min(Tmin, a+b+c-3)
				}
			}
		}
	}

	out(Tmin, Tmax)
}

/*
func main() {
	defer wr.Flush()
	sc.Split(bufio.ScanWords)
	sc.Buffer([]byte{}, 1000000)
	// this template is new version.
	// use getI(), getS(), getInts(), getF()
	N := getI()

	a := make([]pair, 0)
	for i := 1; i*i <= N; i++ {
		if N%i == 0 {
			a = append(a, pair{i, N / i})
		}
	}

	b := make([]cut, 0)
	for _, e := range a {
		b = append(b, f(e)...)
	}

	Tmax := N - 1
	Tmin := Tmax
	for _, e := range b {
		Tmin = min(Tmin, e.a+e.b+e.c-3)
	}
	// out(a)
	// out(b)
	out(Tmin, Tmax)
}
*/