#include "bits/stdc++.h"
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> veci;
typedef vector<string> vecs;
template<class T,class U> using Hash=unordered_map<T,U>;

#define REP(i, a, n) for(ll i = a; i < n; i++)
#define RREP(i, a, n) for(ll i = n-1; i >= a; i--)
#define rep(i, n) REP(i, 0, n)
#define rrep(i, n) RREP(i, 0, n)
#define MD 1000000007

template<class T> T read(){T a;cin >> a;return a;}
template<class T> void read(T& a){cin >> a;}
template<class T> void rarr(T a, int n){for(int i = 0; i < n; i++) {cin >> a[i];}}
template<class T> void write(T a){cout << a << endl;}
template<class T> void writes(vector<T> a, const char* c = " "){cout << a[0];for(int i = 1; i < (int)a.size(); i++)cout << c << a[i];cout << endl;;}
void write(double a){cout << fixed << setprecision(12) << a << endl;}
void write(long double a){cout << fixed << setprecision(12) << a << endl;}
template<class T> void warr(T a, int n, const char* c = " "){cout << a[0];for(int i = 1; i < n; i++)cout << c << a[i];cout << endl;}
void split(string s, string delim, veci& result){result.clear();string::size_type pos = 0;while(pos != string::npos){string::size_type p = s.find(delim, pos);if(p == string::npos){result.push_back(atoi(s.substr(pos).data()));break;}else {result.push_back(atoi(s.substr(pos, p - pos).data()));}pos = p + delim.size();}}
void split(string s, string delim, vecs& result){result.clear();string::size_type pos = 0;while(pos != string::npos){string::size_type p = s.find(delim, pos);if(p == string::npos){result.push_back(s.substr(pos));break;}else {result.push_back(s.substr(pos, p - pos));}pos = p + delim.size();}}
ll gcd(ll a, ll b){while(true){ll k = a % b;if(k == 0)return b;a = b;b = k;}}
ll comb(ll n, ll m){ll p=1;m=min(m,n-m);for(ll i=1;i<=m;i++){p*=n-i+1;p/=i;}return p;}

ll max_div(ll n,double k){
    ll sn=pow(n,k)+0.000002;
    for(ll i=sn;i>=1;i--){
        if(n%i==0)return i;
    }
    return 1;
}

ll f(ll* a){
    return a[0]+a[1]+a[2]-3;
}

int main(void)
{
    ll n;
    ll a[3];
    Hash<ll,ll> h[3];
    cin>>n;
    a[0]=max_div(n,1.0/3.0);
    a[1]=max_div(n/a[0],0.5);
    a[2]=n/a[0]/a[1];
    rep(i,3){
        ll t=a[i];
        for(ll j=2;j*j<=a[i];){
            if(t%j!=0){
                j++;
                continue;
            }
            h[i][j]++;
            t/=j;
        }
        if(t!=1)h[i][t]++;
    }
    ll res=f(a);
    rep(i,3){
        int j=(i+1)%3;
        int k=(i+2)%3;
        for(auto at:h[i]){
            REP(x,1,at.second+1){
                ll b[3]={a[0],a[1],a[2]};
                ll c[3]={a[0],a[1],a[2]};
                ll y=pow(at.first,x);
                //write(res);
                b[j]*=y;b[i]/=y;
                res=min(res,f(b));
                c[k]*=y;c[i]/=y;
                res=min(res,f(c));
            }
        }
    }
    //cout<<a[0]<<" "<<a[1]<<" "<<a[2]<<endl;
    cout<<res<<" "<<n-1<<endl;
    return 0;
}