#include<iostream>
#include<cmath>

using namespace std;

#define MAX 316228

long long N;
bool arr[MAX+1];
long long insuu[MAX];
long long insuun=0;
long long pn[MAX];
long long pc=0;

long long min(long long a,long long b){
	return (a<b)?a:b;
}

long long search(long long a,long long b,long long c,int sn){
	if(sn==insuun) return a+b+c;
	return min(search(a*insuu[sn],b,c,sn+1),min(search(a,b*insuu[sn],c,sn+1),search(a,b,c*insuu[sn],sn+1)));
}

int main(){

	cin>>N;

	long long ansmax=N-1;

	for(long long i=0;i<=MAX;i++){
		arr[i]=true;
	}

	arr[0]=false;
	arr[1]=false;

	for(long long i=2;i<=MAX;i++){
		if(arr[i]){
			pn[pc]=i;
			pc++;
			for(long long j=i*2;j<=MAX;j+=i){
				arr[j]=false;
			}
		}
	}

	for(long long i=0;i<pc;i++) insuu[i]=0;

	for(long long i=0;i<pc;i++){
		while(N%pn[i]==0){
			N/=pn[i];
			insuu[insuun]=pn[i];
			insuun++;
		}
		if(N==1) break;
	}

	if(N!=1) insuu[insuun]=N,insuun++;

	cout<<search(1,1,1,0)-3<<" "<<ansmax<<endl;
}