#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;

bool isPrime(LL a){
    if(a<2) return false;
    for(LL i=2;i*i<=a;i++){
        if(a%i==0) return false;
    }
    return true;
}

int main(void){
    LL N; cin>>N;
    vector<LL> va,vb,vc;
    LL tmin=1e11+7;
    for(LL i=2;i*i*i<=N;i++){
		LL nbufi=N,a,b,c;
		if(isPrime(i)&&nbufi%i==0){
			a=i; nbufi/=a;
			for(LL j=2;j*j<=N;j++){
				LL nbufj=nbufi;
				if(isPrime(j)&&nbufj%j==0){
					b=j; nbufj/=b; c=nbufj;
					va.push_back(a);
					vb.push_back(b);
					vc.push_back(c);
				}
			}
		}
	}

	for(LL i=0;i<va.size();i++){
		//cout<<va[i]<<" "<<vb[i]<<" "<<vc[i]<<endl;
		tmin=min(tmin,(LL)va[i]+vb[i]+vc[i]);
	}
	tmin-=3;
    cout<<tmin<<" "<<N-1<<endl;
}