#include <iostream>
#include <string>
#include <queue>
#include <stack>
#include <algorithm>
#include <list>
#include <vector>
#include <complex>
#include <utility>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <bitset>
#include <ctime>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <cassert>
#include <cstddef>
#include <iomanip>
#include <numeric>
#include <tuple>
#include <random>

#define REP(i,n) for(long (i)=0;(i)<(n);(i)++)
#define FOR(i,a,b) for(long (i)=(a);(i)<(b);(i)++)
#define RREP(i,a) for(long (i)=(a)-1;(i)>=0;(i)--)
#define FORR(i,a,b) for(long (i)=(a)-1;(i)>=(b);(i)--)
#define MOD 1000000007
#define PI acos(-1.0)
#define DEBUG(C) cout<<C<<endl;
#define PII pair<int,int>
#define PLL pair<long,long>
#define ALL(a) (a).begin(),(a).end()
#define SORT(a) sort((a).begin(),(a).end())
#define RSORT(a) sort((a).begin(),(a).end(),greater<int>())

typedef long long LL;
typedef unsigned long long ULL;

using namespace std;

vector<LL> enumDiv(LL a){
	vector<LL> res;
	for(LL i=1;i*i<=a;i++){
		if(a%i==0){
			res.push_back(i);
			if(i*i!=a) res.push_back(a/i);
		}
	}
	SORT(res);
	return res;
}

int main(void){
    LL N; cin>>N;
    LL tmin=N-1;
    vector<LL> nd=enumDiv(N);
	for(LL i=0;nd[i]<=(LL)1000000 && nd[i]*nd[i]*nd[i]<=N;i++){
		for(LL j=i;nd[j]<=(LL)100000000 && nd[i]*nd[j]*nd[j]<=N;j++){
			if(N%(nd[i]*nd[j])==0){
				LL num=nd[i]+nd[j]+N/(nd[i]*nd[j])-3;
				tmin=min(tmin,num);
			}
		}
	}
    cout<<tmin<<" "<<N-1<<endl;
}