#include <iostream>
#include <algorithm>
#include <cmath>
#include <cstdio>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<(n);i++)

const ll INF = 1e16;
int main(void){
    ll n; cin >> n;
    ll tmp = n;
    ll a, b, c, ans = INF;
    
    for (ll i = 1; i <= pow((double)n + 1, 1.0 / 3.0); ++i){
        if(n % i == 0){
            a = i;
            n /= a;
            for (ll j = 1; j <= sqrt((double)n) + 1; ++j){
                if(n % j == 0){
                    b = j;
                    c = n / j;
                }
                ans = min(ans, a + b + c - 3);
                // printf("%lld %lld %lld\n", a, b, c);
            }
        }
        n = tmp;
    }
    printf("%lld %lld\n", ans, tmp - 1);	
    return 0;
}