#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <cstring>
#include <queue>
#include <stack>
#include <math.h>
#include <iterator>
#include <vector>
#include <string>
#include <set>
#include <math.h>
#include <iostream> 
#include<map>
#include <stdlib.h>
#include <list>
#include <typeinfo>
#include <list>
#include <set>
#include <iomanip>
using namespace std;
#define MAX_MOD 1000000007
#define REP(i,n) for(int i = 0;i < n;++i)
#define M_PI 3.14159265359
vector<long long> insuu;
int main() {
	long long n;
	cin >> n;
	long long T_max = n - 1;
	long long now_hoge = 2;
	while (now_hoge < sqrt(n)) {
		if (n%now_hoge == 0) {
			n /= now_hoge;
			insuu.push_back(now_hoge);
		}
		else {
			now_hoge++;
		}
	}
	if (n != 1) {
		insuu.push_back(n);
	}
	long long a[3] = {1,1,1};
	long long hogehoge = insuu.size();
	if (hogehoge == 0) {
		cout << T_max << " " << T_max << endl;
		return 0;
	}
	for (int i = 0;i < hogehoge;++i) {
		a[i % 3] *= insuu[i];
	}
	cout << a[0] + a[1] + a[2] - 3 << " " << T_max << endl;
}