#include<bits/stdc++.h>
#define Add(x,y) (x+y>=mod)?(x+y-mod):(x+y)
#define lowbit(x) x&(-x)
#define pi pair<ll,ll>
#define pii pair<ll,pair<ll,ll>>
#define iip pair<pair<ll,ll>,ll>
#define ppii pair<pair<ll,ll>,pair<ll,ll>>
#define fi first
#define se second
#define full(l,r,x) for(auto it=l;it!=r;it++) (*it)=x
#define Full(a) memset(a,0,sizeof(a))
#define open(s1,s2) freopen(s1,"r",stdin),freopen(s2,"w",stdout);
#define For(i,l,r) for(register int i=l;i<=r;i++)
#define _For(i,l,r) for(register int i=r;i>=l;i--)
using namespace std;
typedef double db;
typedef unsigned long long ull;
typedef long long ll;
bool Begin;
inline ll read(){
    ll x=0,f=1;
    char c=getchar();
    while(c<'0'||c>'9'){
        if(c=='-')
          f=-1;
        c=getchar();
    }
    while(c>='0'&&c<='9'){
        x=(x<<1)+(x<<3)+(c^48);
        c=getchar();
    }
    return x*f;
}
inline void write(ll x){
	if(x<0){
		putchar('-');
		x=-x;
	}
	if(x>9)
	  write(x/10);
	putchar(x%10+'0');
}
ll n,ans;
vector<ll> v;
void init(){
	for(ll 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());
}
bool End;
int main(){
	n=read();
	init();
	ans=n-1;
	for(ll i=0;v[i]<=1000000&&v[i]*v[i]*v[i]<=n;i++)
	  for(ll j=i;v[j]<=100000000&&v[i]*v[j]*v[j]<=n;j++)
		if(n%(v[i]*v[j])==0)
		  ans=min(ans,v[i]+v[j]+n/v[i]/v[j]-3);
	write(ans);
	putchar(' ');
	write(n-1);
	cerr<<'\n'<<abs(&Begin-&End)/1048576<<"MB";
	return 0;
}