#include <iostream>
#include <vector>
#include <map>
#include <algorithm>
using namespace std;

#define REP(i,s,e) for (i = s; i <= e; i++)
#define rep(i,n) REP (i,0,(int)(n)-1)
#define RREP(i,s,e) for (i = s; i >= e; i--)
#define rrep(i,n) RREP (i,(int)(n)-1,0)
#define INF (int)1e8
#define MOD (int)(1e9+7)

typedef long long ll;

ll a[3];
map<tuple<ll,ll,ll>,ll> mp;
vector<ll> divisor;

ll dfs(int i) {
    tuple<ll,ll,ll> tp;
    int b[3] = {0,1,2};
    if (divisor.size() == i)
        return a[0] + a[1] + a[2] - 3;
    do {
        tp = make_tuple(a[b[0]],a[b[1]],a[b[2]]);
        if (mp.count(tp))
            return mp[tp];
    } while (next_permutation(b,b+3));
    tp = make_tuple(a[0],a[1],a[2]);
    ll ret;
    a[0] *= divisor[i];
    ret = dfs(i+1);
    a[0] /= divisor[i];
    a[1] *= divisor[i];
    ret = min(ret,dfs(i+1));
    a[1] /= divisor[i];
    a[2] *= divisor[i];
    ret = min(ret,dfs(i+1));
    a[2] /= divisor[i];
    return mp[tp] = ret;
}


int main(void) {
    ll i, j, n, x;
    cin >> n;

    x = n;
    for (i = 2; i * i <= n; i++) {
        if (n % i == 0) {
            divisor.push_back(i);
            n /= i;
            i--;
        }
    }
    divisor.push_back(n);
    a[0] = a[1] = a[2] = 1;
    cout << dfs(0) << " " << x - 1 << endl;
    return 0;
}