#define _USE_MATH_DEFINES
#include <cstdio>
#include <iostream>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <complex>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <numeric>
#include <limits>
#include <climits>
#include <cfloat>
#include <functional>
using namespace std;

void integerFactorization(long long n, vector<long long>& base, vector<int>& expo)
{
    base.clear();
    expo.clear();
    long long a = 2;
    while(a * a <= n){
        int b = 0;
        while(n % a == 0){
            ++ b;
            n /= a;
        }
        if(b > 0){
            base.push_back(a);
            expo.push_back(b);
        }
        ++ a;
    }
    if(n > 1){
        base.push_back(n);
        expo.push_back(1);
    }
}

long long solve(const vector<long long>& base, const vector<int>& expo, int k, const vector<long long>& x)
{
    if(k == base.size()){
        long long ans = 0;
        for(int i=0; i<3; ++i)
            ans += x[i] - 1;
        return ans;
    }

    long long ans = LLONG_MAX;
    vector<long long> y = x;
    for(int a=0; a<=expo[k]; ++a){
        for(int b=0; a+b<=expo[k]; ++b){
            int c = expo[k] - a - b;
            for(int i=0; i<c; ++i)
                y[2] *= base[k];
            ans = min(ans, solve(base, expo, k+1, y));

            y[2] = x[2];
            y[1] *= base[k];
        }
        y[1] = x[1];
        y[0] *= base[k];
    }

    return ans;
}

int main()
{
    long long n;
    cin >> n;

    vector<long long> base;
    vector<int> expo;
    integerFactorization(n, base, expo);

    vector<long long> x(3, 1);
    cout << solve(base, expo, 0, x) << ' ' << (n - 1) << endl;

    return 0;
}