#include <unordered_set>
#include <vector>
#include <iostream>
using namespace std;

typedef unsigned long long ull;

ull tmin = 0;
vector<ull> v;

vector<ull> f(ull n) {
    vector<ull> v;
    ull a = 0, b = 2;
    while (b * b <= n) {
        if (n % b == 0){
            n /= b;
            v.push_back(b);
        } else {
            b += 1 + a;
            a = 1;
        }
    }
    if (n) { v.push_back(n); }
    return v;
}

void e3(ull a, ull b, ull c, int i) {
    ull s = a + b + c;
    if (s > tmin) { return; }
    if (i < 0) {
        tmin = min(s, tmin);
        return;
    }
    int j = i - 1;
    e3(a * v[i], b, c, j);
    e3(a, b * v[i], c, j);
    e3(a, b, c * v[i], j);
    return;
}

void e2(ull a, ull b, ull c, int i) {
    if (i < 0) {
        tmin = min(a + b + c, tmin);
        return;
    }
    e3(a * v[i], b, c, i - 1);
    e3(a, b * v[i], c, i - 1);
    return;
}

void e1(ull a, ull b, ull c, int i) {
    if (i < 0) {
        tmin = min(a + b + c, tmin);
        return;
    }
    e2(a * v[i], b, c, i - 1);
    return;
}

int main() {
    ull a;
    cin >> a;
    v = f(a);
    if (v.size() > 3) {
        tmin = a - 1;
        bool b = true;
        while (b) {
            b = false;
            vector<ull> l;
            unordered_set<ull> s;
            for (ull i : v) { s.insert(i); }
            for (ull i : s) {
                int c = 0;
                for (ull j : v){ if (j == i) { c += 1; } };
                if (c > 3) {
                    l.push_back(i*i);
                    for (int j = 0; j < c - 2; ++j){ l.push_back(i); }
                    b = true;
                } else {
                    for (int j = 0; j < c; ++j){ l.push_back(i); }
                }
            }
            v = l;
        }
        e1(1, 1, 1, v.size() - 1);
        cout << tmin - 3 << " " << a-1 << endl;
    } else {
        ull s = 0;
        for (int i = 0; i < v.size(); ++i) {
            s += v[i];
        }
        cout << s - v.size() << " " << a-1 << endl;
    }
    return 0;
}