#!/usr/bin/env python3

import math


def divisors(n):
    xs = []
    for i in range(1, math.ceil(math.sqrt(n)) + 1):
        d, m = divmod(n, i)
        if m == 0:
            xs.append(i)
            if i * i != n:
                xs.append(d)
    xs.sort()
    return xs


def compute_max(n):
    return n - 1


def compute_min(n):
    ds = divisors(n)
    ans = compute_max(n)
    for a in ds:
        if a * a * a > n:
            break
        for b in ds:
            if a * b * b > n:
                break
            c, m = divmod(n, a * b)
            if m == 0:
                ans = min(ans, a + b + c - 3)
    return ans


def main():
    n = int(input())
    print("{} {}".format(compute_min(n), compute_max(n)))


if __name__ == '__main__':
    main()