#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;

  REP(i, 1, min(500LL, N))
  REP(j, 1, min(500LL, N))
  REP(k, 1, min(500LL, N)) {
    ll ni = __gcd(N, (ll)i);
    ll nj = __gcd(N, (ll)j);
    ll nk = __gcd(N, (ll)k);
    if(N % ni == 0 && N % nj == 0 && N % nk == 0) {
      if(ni * nj * nk == N) {
        minimize(ans, ni + nj + nk - 3);
      }
    }
  }

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

  return 0;
}