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

vector<long long> primef(long long n){
	vector<long long> v;
	for(long long i = 1;i * i <= n;i++){
		if(n % i == 0){
			v.push_back(i);
			if(i * i != n) v.push_back(n / i);
		}
	}
	sort(v.begin(),v.end());
	return v;
}

int main(){
	long long n;
	cin >> n;
	vector<long long> v = primef(n);
	long long mini = n - 1;
	for(int i = 0;v[i] <= 100000 && v[i] * v[i] * v[i] <= n;i++){
		for(int j = i;v[j] <= 100000000 && v[i] * v[j] * v[j] <= n;j++){
			if(n % (v[i] * v[j]) == 0) mini = min(mini,v[i] + v[j] + n / v[i] / v[j] - 3);
		}
	}
	cout << mini << ' ' << --n << endl;
}