#include<cstdio>
#include<iostream>
#include<algorithm>
#include<string>
#include<queue>
#include<vector>
#include<functional>
#include<cmath>
#include<map>
#include<stack>
#include<set>
#include<numeric>
#include<limits>

#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()

using namespace std;
typedef long long ll;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ll, string> pls;

int main()
{
	ll N,mx,mi=0,num;
	cin >> N;

	mx = N - 1;
	mi = N -1;
	for (int i = cbrt(N) + 1; i > 0; i--) {
		if (N % i != 0)continue;
		for (int j = sqrt(N / i); j > 0; j--) {
			if (N / i%j != 0)continue;
			num = i + j + N / i / j - 3;
			mi = min(num, mi);
		}
	}
	cout << mi << " " << mx << endl;
	return 0;
}