#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>

#define REP(i,s,n) for(int i=(int)(s);i<(int)(n);i++)

using namespace std;
typedef long long int ll;
typedef vector<int> VI;
typedef pair<int, int> PI;
const double EPS=1e-9;

ll calc(ll n) {
  ll mi = n + 2;
  for (ll a = 1; a * a * a <= n; ++a) {
    if (n % a != 0) continue;
    for (ll b = (ll)(sqrt(n / a) + 0.5); b >= a; --b) {
      if (n / a % b != 0) continue;
      mi = min(mi, a + b + n / a / b);
      break;
    }
  }
  return mi;
}

int main(void){
  ll n;
  cin >> n;
  cout << calc(n) - 3 << " " << n - 1 << endl;
}