#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long ll;
int main(){
  ll N;cin>>N;
  ll T_MIN=N-1,T_MAX=N-1;
  vector<ll> v;
  ll N2=N;
  for(ll i=2;i*i<=N;++i){
    while(1){
      if(N2==1) break;
      if(N2%i==0){
        N2/=i;
        v.push_back(i);
      } else {
        break;
      }
    }
  }
  if(N2!=1) v.push_back(N2);
  cerr<<endl;
  if(v.size()==1){
    //
  } else if(v.size()==2){
    ll a=v[0];
    ll b=v[1];
    T_MIN=a-1+b-1;
  } else {
    vector<ll> v2=v;
    do{
    ll a=1;
    for(int i=0;i<v2.size()-2;++i){
      a*=v2[i];
      ll b=1;
      for(int j=i+1;j<v2.size()-1;++j){
        b*=v2[j];
        ll c=1;
        for(int k=j+1;k<v2.size();++k){
          c*=v2[k];
        }
        ll s=a+b+c;
        if(s-3<T_MIN) T_MIN=s-3;
      }
    }
  } while(next_permutation(v2.begin(),v2.end()));
  }
  cout<<T_MIN<<" "<<T_MAX<<endl;
}