#include <bits/stdc++.h>
using namespace std;

struct uns_t {} uns;
template <typename Element, typename Head, typename ...Args>
auto vec(Element init, Head arg, Args ...args) {
    if constexpr (sizeof...(Args) == 0) return std::vector(arg, init);
    else return std::vector(arg, vec(init, args...));
}
template <typename Element, typename Head, typename ...Args>
auto vec(uns_t, Head arg, Args ...args) {
    return vec(Element(), arg, args...);
}

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

    auto prime_factor = [](int64_t n) {
        auto p = vec<array<int64_t, 2>>(uns, 0);
        for (int64_t i = 2; i * i <= n; ++i) {
            if (n % i) continue;
            int cnt = 0;
            while (n % i == 0) {
                n /= i;
                ++cnt;
            }
            p.push_back({ i, cnt });
        }
        if (n != 1) {
            p.push_back({ n, 1 });
        }
        return p;
    };

    priority_queue<int64_t, vector<int64_t>, greater<int64_t>> que;
    que.push(1);
    que.push(1);
    que.push(1);
    for (auto [a, b] : prime_factor(n)) {
        while (b--) {
            auto m = que.top(); que.pop();
            m *= a;
            que.push(m);
        }
    }

    auto a = que.top(); que.pop();
    auto b = que.top(); que.pop();
    auto c = que.top(); que.pop();

    cout << (a + b + c - 3) << ' ' << (n - 1) << endl;
}