#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<math.h>
#include<stack>
#include<queue>
#include<vector>
#include<algorithm>
#include<string>
#include<iostream>
#include<set>
#include<map>
#include<bitset>

using namespace std;
typedef long long ll;
#define i_7 1000000007
#define i_5 1000000005

ll mod(ll a){
    ll c=a%i_7;
    if(c>=0)return c;
    else return c+i_7;
}
typedef pair<int,int> i_i;
typedef pair<ll,ll> l_l;
ll inf=1000000000000;/*10^12*/
#define rep(i,l,r) for(ll i=l;i<=r;i++)
ll max(ll a,ll b){if(a<b)return b;else return a;}
ll min(ll a,ll b){if(a>b)return b;else return a;}


//////////////////////////////////////

int main(){
    ll n;cin>>n;
    ll ans=n-1;
    for(ll a=1;a*a*a<=n;a++){
        if(n%a!=0)continue;
        for(ll b=a;a*b*b<=n;b++){
            if(n%b==0){
                if(n%(a*b)==0){
                    ans=min(a+b+n/a/b-3,ans);
                }
            }
        }
    }
    cout<<ans<<" "<<n-1<<endl;
    return 0;
}