#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <complex>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <iomanip>
#include <assert.h>
#include <array>
#include <cstdio>
#include <cstring>
#include <random>
#include <functional>
#include <numeric>
#include <bitset>
#include <fstream>

using namespace std;

#define REP(i,a,b) for(int i=a;i<(int)b;i++)
#define rep(i,n) REP(i,0,n)
#define all(c) (c).begin(), (c).end()
#define zero(a) memset(a, 0, sizeof a)
#define minus(a) memset(a, -1, sizeof a)
#define watch(a) { cout << #a << " = " << a << endl; }
template<class T1, class T2> inline bool minimize(T1 &a, T2 b) { return b < a && (a = b, 1); }
template<class T1, class T2> inline bool maximize(T1 &a, T2 b) { return a < b && (a = b, 1); }

typedef long long ll;
int const inf = 1<<29;

int main() {

  ll N; cin >> N;

  ll INF = std::numeric_limits<ll>::max();
  ll ans = INF;

  vector<ll> vs;
  for(int i=1; (ll)i*i<=N; i++) {
    if(N % i == 0) {
      vs.push_back(i);
    }
  }

  int M = vs.size();

  REP(i, 1, min(800, M))
  REP(j, 1, min(800, M))
  REP(k, 1, min(800, M))
  if(N % vs[i] == 0 && N % vs[j] == 0 && N % vs[k] == 0) {
    rep(a, 2) rep(b, 2) rep(c, 2) {
      ll ni = a ? vs[i] : N / vs[i];
      ll nj = b ? vs[j] : N / vs[j];
      ll nk = c ? vs[k] : N / vs[k];
      if(ni * nj * nk == N) {
        minimize(ans, ni + nj + nk - 3);
      }
    }
  }

  cout << (ans == INF ? N - 1 : ans) << " " << N - 1 << endl;

  return 0;
}