#include <iostream>
#include <math.h>
#include <algorithm>
#include <vector>
using namespace std;
typedef long long ll;
vector<ll> list;
int main() {
	ll n;	cin >> n;
	for (ll i = 1; i*i <= n; i++)	if (n%i == 0)	list.push_back(i);
	//(a+1)(b+1)(c+1)=Nを満たす中でのa+b+cの最小値
	ll ans = 1e15;
	for (ll a = 0; a < list.size(); a++) {
		for (ll b = 0; b < list.size() && list[a] * list[b] <= n; b++) {
			ll c = distance(list.begin(), find(list.begin(), list.end(), n / list[a] / list[b]));
			ans = min(list[a] + list[b] + list[c] - 3, ans);
		}
	}
	cout << ans << " " << n - 1 << endl;
	return 0;
}