#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> map<T, int> factorize(T n) {
  map<T, int> ret;
  for (T i = 2; i * i <= n; i++) {
    while (n % i == 0) {
      ++ret[i];
      n /= i;
    }
  }
  if (n != 1) ret[n] = 1;
  return ret;
}

typedef pair<ll, int> LI;

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

  priority_queue<LI, vector<LI>, greater<LI> > q;
  FORR(fa, factorize(N)) q.push(fa);

  ll a=1, b=1, c=1;

  while (!q.empty()) {
    ll p = q.top().fst;
    int n = q.top().snd;
    q.pop();
    REP(i, n) {
      ll *mi = a < b ? &a : &b;
      if (c < *mi) mi = &c;
      *mi *= p;
    }
  }

  _P("%lld %lld\n", a + b + c - 3, N-1);
}
int main() { cin.tie(0); ios::sync_with_stdio(false); Main(); return 0; }