#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=a;i<b;i++)
#define INF 1LL<<60
typedef long long ll;

map<ll, int> enumdiv(ll n) {
	map<ll, int> V;
	if (n == 1) V[1] = 1;
	else {
		for (ll i = 2; i*i <= n; i++) while (n%i == 0) V[i]++, n /= i;
		if (n>1) V[n]++;
	}
	return V;
}

set<ll> yakusu(ll n)
{
	auto pri = enumdiv(n);
	vector<ll> pri2;
	for (auto p : pri) rep(i, 0, p.second) pri2.push_back(p.first);

	set<ll> ret;
	rep(i, 0, pri2.size())
	{
		ret.insert(1);

		set<ll> n_ret;
		for (auto p : ret) n_ret.insert(p);
		for (auto p : ret) n_ret.insert(p * pri2[i]);

		ret = n_ret;
	}
	return ret;
}

ll N;

ll calc(vector<ll> primes)
{
	ll ans = INF;
	auto p = yakusu(N);
	for (ll A : p)
	{
		ll other = N / A;
		auto pp = yakusu(other);
		for (ll B : pp)
		{
			ll C = other / B;

			//cout << "[ " << A << " " << B << " " << C << " ]" << endl;
			ans = min(ans, A + B + C - 3);
		}
	}

	return ans;
}

int main()
{
	cin.tie(0);
	ios::sync_with_stdio(false);

	while (cin >> N)
	{
		auto ps = enumdiv(N);
		vector<ll> primes;
		for (auto p : ps) rep(i, 0, p.second) primes.push_back(p.first);
		//rep(i, 0, primes.size()) cout << primes[i] << " ";
		//cout << endl;

		ll ans = 0;
		if (3 < primes.size())
			ans = calc(primes);
		else
			rep(i, 0, primes.size()) ans += primes[i] - 1LL;

		cout << ans << " " << (N - 1LL) << endl;
	}
}