#include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i,n) for(int i=0;i<(int)n;++i)
#define each(a, b) for(auto (a): (b))
#define all(v) (v).begin(),(v).end()
#define fi first
#define se second
#define pb push_back
#define show(x) cout <<#x<<" = "<<(x)<<endl
#define spair(p) cout <<#p<<": "<<p.fi<<" "<<p.se<<endl
#define svec(v) cout<<#v<<":";rep(kbrni,v.size())cout<<" "<<v[kbrni];cout<<endl
#define sset(s) cout<<#s<<":";each(kbrni,s)cout <<" "<<kbrni;cout<<endl

using namespace std;

typedef pair<int,int>P;

const int MAX_N = 100005;

vector<ll> divisor(ll n)
{
    vector<ll> res;
    for(ll i=1;i*i<=n;i++){
        if(n%i==0){
            res.pb(i);
            if(i != n/i){
                res.pb(n/i);
            }
        }
    }
    sort(all(res));
    return res;
}

int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    ll n;
    cin >> n;
    vector<ll> res = divisor(n);
    ll mn = 1LL << 60;
    ll mx = 0;
    rep(i,res.size()){
        ll bf = n;
        bf /= res[i];
        for(int j=i;j<(int)(res.size());j++){
            if(bf % res[j] == 0){
                ll rem = bf / res[j];
                ll sm = res[i] + res[j] + rem;
                mn = min(mn,sm);
                mx = max(mx,sm);
            }
        }
    }
    cout << mn-3 << " " << mx-3 << endl;
    return 0;
}