#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define REP(i,a,b) for(ll i=(a);i<(b);++i)
#define REPREV(i,a,b) for(ll i=(b)-1;i>=(a);--i)

#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define DEBUG_VEC(v) cout<<#v<<":";REP(i,v.size())cout<<" "<<v[i];cout<<endl
#define ALL(a) (a).begin(),(a).end()

#define CHMIN(a,b) a=min((a),(b))
#define CHMAX(a,b) a=max((a),(b))

// mod
const ll MOD = 1000000007ll;
#define FIX(a) ((a)%MOD+MOD)%MOD

// floating
typedef double Real;
const Real EPS = 1e-11;
#define EQ0(x) (abs(x)<EPS)
#define EQ(a,b) (abs(a-b)<EPS)
typedef complex<Real> P;

int main(){
  ll n;
  cin>>n;
  ll tmax = n-1;
  ll tmin = n-1;
  for(ll i=1;i*i*i<=n;i++){
    if(n%i!=0)continue;
    ll m = n/i;
    for(ll j=i;j*j<=m;j++){
      if(m%j!=0)continue;
      ll k = m/j;
      CHMIN(tmin,i+j+k-3);
    }
  }
  printf("%lld %lld\n",tmin,tmax);
  return 0;
}