#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
long N;
main()
{
	cin>>N;
	vector<long>div;
	for(long i=1;i*i<=N;i++)
	{
		if(N%i==0)
		{
			div.push_back(i);
			if(N/i>i)div.push_back(N/i);
		}
	}
	long ans=N-1;
	sort(div.begin(),div.end());
	for(int i=0;i<div.size();i++)
	{
		int j=0;
		while(j<div.size()&&div[i]*div[j]<=N)
		{
			ans=min(ans,div[i]+div[j]+N/div[i]/div[j]-3);
			j++;
		}
	}
	cout<<ans<<" "<<N-1<<endl;
}