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

#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FORR(x,arr) for(auto&& x:arr)
#define FOR(i,a,b) for (int i = (a); i < (b); i++)
#define RFOR(i,a,b) for (int i = (b)-1; i >= (a); i--)
#define REP(i,n) for (int i = 0; i < (n); i++)
#define RREP(i,n) for (int i = (n)-1; i >= 0; i--)
#define ALL(x) (x).begin(), (x).end()
#define BIT(n) (1LL<<(n))
#define SZ(x) ((int)(x).size())
#define fst first
#define snd second
#define DUMP( x ) cerr << #x << " = " << ( x ) << endl
typedef long long ll;
// -------------------------------------

template <typename T> vector<T> divisors(T n) {
  vector<T> ret;
  for (T i = 1; i * i <= n; i++) {
    if (n % i == 0) {
      ret.push_back(i);
      if (i * i != n) ret.push_back(n / i);
    }
  }
  sort(ret.begin(), ret.end());
  return ret;
}

void Main() {
  ll N;
  cin >> N;

  vector<ll> d = divisors(N);

  ll ans = N - 1;

  for (ll i = 0; d[i] < 1000000 && d[i] * d[i] * d[i] <= N; i++) {
    ll x = N / d[i];
    for (ll j = 0; d[j] < 1000000000 && d[j] * d[j] <= x; j++) {
      if (x % d[j] == 0) {
        ll y = d[i] + d[j] + x / d[j] - 3;
        ans = min(ans, y);
      }
    }
  }

  cout << ans << ' ' << N-1 << endl;
}
int main() { cin.tie(0); ios::sync_with_stdio(false); Main(); return 0; }