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

vector<long> func2(long n)
{
    vector<long> res;
    for(long i=1; i*i<=n; ++i) {
        if (n%i) continue;
        res.push_back(i);
        if (n!=i*i) res.push_back(n/i);
    }
    return res;
}

int main()
{
    long n;
    cin>>n;
    auto d=func2(n);
    sort(begin(d), end(d));

    long res=n-1;
    for(auto& x: d) {
        for(auto& y: d) {
            if (n/x%y) continue;
            res=min(res, x-1+y-1+n/x/y-1);
        }
    }
    cout<<res<<' '<<n-1<<endl;
}