#include<iostream>
#include<sstream>
#include<cstdio>
#include<cstring>
#include<string>
#include<vector>
#include<list>
#include<queue>
#include<stack>
#include<utility>
#include <fstream>
#include<set>
#include<map>
#include<cctype>
#include<cmath>
#include<algorithm>
#include <numeric>
using namespace std;


#define RALL(x) (x).rbegin(),(x).rend()
#define ALL(x) (x).begin(),(x).end()
#define repp(i,n) for(int (i)=1;(i)<=(n);(i)++)
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rev(i,n) for(int (i)=(n-1);(i)>=0;(i)--)
#define clr(a) memset((a), 0 ,Nof(a))
#define found(s,e) ((s).find(e)!=(s).end())

typedef pair<int,int> P;
typedef vector<pair<int,int> > pii;
typedef map<string,int> mdi;



int main(){
	long long n,t;
	cin >> n;
	t=n;
	for(long long i=1;i*i*i<=n;i++){
		if(n%i==0){
			long long m=n/i;
			for(long long j=1;j*j<=m;j++){
				if(m%j==0){
					long long k=m/j;
					if(t>i+j+k-3)
						t=i+j+k-3;
				}
			}
		}
	}
	
	cout << t << " " << n-1 << endl;
	return 0;
}