#include <bits/stdc++.h>
#define REP(i,n) for(int i = 0; i < (int)(n); ++i)
using namespace std;

int main(){
    long long N;
    cin >> N;
    long long ans = N-1;
    for(long long i = 1; i <= ceil(pow(N,0.34)); i++){
        if(N%i == 0){
            for(long long p = 1; p <= ceil(pow(N/i,0.5)); p++){
                if(N%(i*p)==0){
                    ans = min(ans,i+p+N/(i*p)-3);
                }
            }
        }
    }
    cout << ans << " " << N-1 << endl;
    return 0;
}