#include <iostream>
#include <string>
#include <vector>
#include <cmath>
#include <algorithm>
#include <cstdlib>
#include <ctime>
#include <cstdio>
#include <functional>
#include <set>
#include <sstream>
#include <map>
#include <queue>
#include <stack>

using namespace std;

const long long mod=1000000007; 

double PI =3.141592653589793;

int main()
{
	long long n;
	cin>>n;

	long long Tmax=n-1;
	long long Tmin=n;
	
	for(long long a=1;a*a*a<=n;a++){
		for(long long b=1;b*b*b<=n;b++){
			if(n%(a*b)) continue;
			long long c=n/a/b;
			Tmin=min(Tmin,a+b+c-3);
		}
	}
	cout<<Tmin<<" "<<Tmax<<endl;

	
	return 0;
}