#include <bits/stdc++.h>
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define FORR(i,a,b) for (int i=(a);i>=(b);i--)
#define pb push_back
#define pcnt __builtin_popcount
#define show(x) cout<<#x<<" = "<<x<<endl;
#define maxs(x,y) x = max(x,y)
#define mins(x,y) x = min(x,y)
#define fi first
#define se second
#define rng(a) a.begin(),a.end()
#define each(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define sz(x) (int)(x).size()
#define mp make_pair

using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vpii;
typedef set<int> si;
typedef pair<ll,ll> pll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<pll> vpll;
typedef set<ll> sl;
template<typename T>string join(vector<T>&v)
{stringstream s;FOR(i,0,sz(v))s<<' '<<v[i];return s.str().substr(1);}
ll gcd(ll a,ll b){if(a>b)swap(a,b);for(;a>0;b%=a,swap(a,b));return b;}
int modpow(ll a,ll n,int m){if(a==0)return a;ll p=1;for(;n>0;n/=2,a=a*a%m)if(n&1)p=p*a%m;return(int)p;}
void dout(double d){printf("%.12f\n",d);}

const int iinf = 1e9;
const ll linf = 1e18;
const int mod = 1e9+7;
const double pi = acos(-1);
const double eps = 1e-10;
vl v;
void divisor(ll a){ // v に約数が入る
  v.pb(1);
  for(ll i = 2; i*i <= a; i++){
    if(a%i == 0){
      ll b = 1, vs = sz(v);
      while((a%i) == 0){
        a /= i;
        b *= i;
        FOR(j, 0, vs)v.pb(v[j] * b);
      }
    }
  }
  if(a>1){
    int vs = sz(v);
    FOR(j, 0, vs)v.pb(v[j] * a);
  }
}
ll n, ansmi = linf;
main(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  cin >> n;
  divisor(n);
  sort(rng(v));
  int l = sz(v);
  ll t;
  FOR(i, 0, l){
    if(n / v[i] < v[i]) break;
    FOR(j, i, l){
      if(n / v[i] / v[j] < v[j]) break;
      if(n / v[i] % v[j] == 0){
        t = v[i] + v[j] + n/v[i]/v[j];
        mins(ansmi, t);
      }
    }
  }
  cout << ansmi-3 << " " << n-1 << endl;
  return 0;
}