#include "bits/stdc++.h"
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
static const int INF = 0x3f3f3f3f; static const long long INFL = 0x3f3f3f3f3f3f3f3fLL;
typedef vector<int> vi; typedef pair<int, int> pii; typedef vector<pair<int, int> > vpii; typedef long long ll;
template<typename T, typename U> static void amin(T &x, U y) { if(y < x) x = y; }
template<typename T, typename U> static void amax(T &x, U y) { if(x < y) x = y; }

vector<bool> isprime;
vector<int> primes;
void sieve(int n) {
	if((int)isprime.size() >= n + 1) return;
	isprime.assign(n + 1, true);
	isprime[0] = isprime[1] = false;
	int sqrtn = (int)(sqrt(n * 1.) + .5);
	for(int i = 2; i <= sqrtn; i ++) if(isprime[i]) {
		for(int j = i * i; j <= n; j += i)
			isprime[j] = false;
	}
	primes.clear();
	for(int i = 2; i <= n; i ++) if(isprime[i])
		primes.push_back(i);
}

typedef long long FactorsInt;
typedef vector<pair<FactorsInt, int> > Factors;
void primeFactors(FactorsInt x, Factors &out_v) {
	out_v.clear();
	int sqrtx = (int)(sqrt(x*1.) + 10.5);
	sieve(sqrtx);
	for(vector<int>::const_iterator p = primes.begin(); p != primes.end(); ++ p) {
		if(*p > sqrtx) break;
		if(x % *p == 0) {
			int t = 1;
			x /= *p;
			while(x % *p == 0) {
				t ++;
				x /= *p;
			}
			out_v.push_back(make_pair(*p, t));
		}
	}
	if(x != 1) out_v.push_back(make_pair(x, 1));
}

ll mini, maxi;
void rec(int i, ll cur[3], int prev, const vector<ll> &ps) {
	if(i == ps.size()) {
		ll t = (cur[0] - 1) + (cur[1] - 1) + (cur[2] - 1);
		amin(mini, t);
		amax(maxi, t);
		return;
	}
	rep(k, 3) {
		if(i != 0 && ps[i - 1] == ps[i] && !(prev <= k)) continue;
		cur[k] *= ps[i];
		rec(i + 1, cur, k, ps);
		cur[k] /= ps[i];
	}
}

int main() {
	long long N;
	while(~scanf("%lld", &N)) {
		Factors fs;
		primeFactors(N, fs);
		vector<ll> ps;
		for(auto p : fs) rep(j, p.second)
			ps.push_back(p.first);
		ll cur[3] = { 1,1,1 };
		mini = INFL, maxi = -1;
		rec(0, cur, 0, ps);
		printf("%lld %lld\n", mini, maxi);
		//a * b * c
	}
	return 0;
}