#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; i*i <= N; i++) {
    vs.push_back(__gcd(N, ll(i)));
  }

  sort(all(vs)); vs.erase(unique(all(vs)), vs.end());

  rep(i, vs.size()) rep(j, vs.size()) rep(k, vs.size()) {
    if(vs[i] == N / vs[j] / vs[k]) {
      minimize(ans, vs[i] + vs[j] + vs[k] - 3);
    }
  }

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

  return 0;
}