#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<=n;a++){
		if(n%a) continue;
		long long m=n/a;
		for(long long b=1;b*b<=m;b++){
			if(m%b) continue;
			
			long long c=m/b;
			Tmin=min(Tmin,a+b+c-3);
		}
	}
	
	cout<<Tmin<<" "<<Tmax<<endl;

	
	return 0;
}