#include <iostream>
#include <algorithm>
#include <functional>
#include <vector>
#include <cmath>
#include <cstdio>
#include <cstdlib>
using namespace std;
typedef long long ll;
typedef pair<int,int> pint;
typedef vector<int> vint;
typedef vector<pint> vpint;
#define mp make_pair
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define reps(i,f,n) for(int i=(f);i<(n);i++)

const int INF = 1e9;
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/ 3) + 1 ; ++i){
        if(n % i == 0) a = i;
    
        n /= a;
        for (ll i = a; i <= n ; ++i){
            if(n % i == 0){
                b = i;
                c = n / i;
            }
            ans = min(ans, a + b + c - 3);
        }
        n = tmp;
    }
    printf("%lld %lld\n", ans, tmp - 1);	
    return 0;
}