#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> v;
	LL tmin=0;
	if(N<=3) tmin=N-1;
	else{
		LL nbuf=N;
		for(int i=2;i*i<=nbuf;i++){
			if(isPrime(i)){
				while(nbuf%i==0){
					nbuf/=i;
					v.push_back(i);
				}
			}
		}
		if(nbuf) v.push_back(nbuf);
		while(v.size()>4){
			int vs=v.size();
			REP(i,vs/2){
				v[i]*=v.back();
				v.pop_back();
			}
			SORT(v);
		}
		if(v.size()==4){
			v[0]*=v[3]; v.pop_back();
		}
		tmin=accumulate(v.begin(), v.end(), 0)-v.size();
	}
	cout<<tmin<<" "<<N-1<<endl;
}