#include <bits/stdc++.h>
#define INIT std::ios::sync_with_stdio(false);std::cin.tie(0);
// VAR(int, x);
#define VAR(type, ...)type __VA_ARGS__;Scan(__VA_ARGS__);
template<typename T> void Scan(T& t){std::cin >> t;}
template<typename First,typename...Rest>void Scan(First& first,Rest&...rest){std::cin>>first;Scan(rest...);}
#define OUT(d) std::cout<<(d);
#define FOUT(n, d) std::cout<<std::fixed<<std::setprecision(n)<<(d);
#define SOUT(n, d) std::cout<<std::setw(n)<<(d);
#define SP std::cout<<" ";
#define TAB std::cout<<"\t";
#define BR std::cout<<"\n";
#define ENDL std::cout<<std::endl;
#define FLUSH std::cout<<std::flush;
#define VEC(type, c, n) std::vector<type> c(n);for(auto& i:c)std::cin>>i;
#define MAT(type, c, m, n) std::vector<std::vector<type>> c(m, std::vector<type>(n));for(auto& r:c)for(auto& i:r)std::cin>>i;
#define ALL(a) (a).begin(),(a).end()
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define RFOR(i, a, b) for(int i=(b)-1;i>=(a);--i)
#define REP(i, n) for(int i=0;i<int(n);++i)
#define RREP(i, n) for(int i=(n)-1;i>=0;--i)
#define PAIR std::pair<int, int>
#define IN(a0, y, a1, b0, x, b1) (a0<=y && y<a1 && b0<=x && x<b1)
#define SHOW(d) {std::cout << #d << "\t:" << d << "\n";}
#define SHOWVECTOR(v) {std::cout << #v << "\t:";for(auto i : v){std::cout << i << " ";}std::cout << "\n";}
#define SHOWVECTOR2(v) {std::cout << #v << "\t:\n";for(auto i : v){for(auto j : i){std::cout << j << " ";}std::cout << "\n";}}
#define SHOWPAIRVECTOR(v) {for(auto i:v){std::cout<<'('<<i.first<<", "<<i.second<<") ";}std::cout<<"\n";}

#define CHECKTIME(state) {std::cout<<#state<<"\t\n";auto startTime=std::chrono::system_clock::now();state;auto endTime=std::chrono::system_clock::now();auto resTime=std::chrono::duration_cast<std::chrono::nanoseconds>(endTime-startTime).count();std::cout<<"Time:"<<resTime<<"ns\n";}

#define int ll
using ll = long long;
constexpr ll INF = 1LL<<60;

int PrimeFactNum(int n){
    int ans = 1;
        for(int i=2; i*i<=n; ++i){
            int divCount = 0;
            if(n%i == 0){
                do{
                    ++divCount;
                    n/=i;
                }while(n%i == 0);
                ans *= divCount+1;
            }
        }
    if(n!=1){
        return ans*2;
    }
    return ans;
}

signed main(){
    INIT;
    //CHECKTIME([&](){
    
    VAR(ll, n);
    int pn = PrimeFactNum(n);
    double a = std::pow(n, 1.0/3);
    ll x1 = 1;
    ll min = INF;
    for(ll i=std::ceil(a); i>=1; --i){
        if(min!=INF && i<=std::pow(n, pn/175.0)) break;
        ll tn = n;
        if(tn%i==0){
            tn /= i;
            x1 = i;
            double b = std::pow(tn, 1.0/2);
            for(ll j=std::ceil(b); j>=1; --j){
                if(tn%j==0){
                    min = std::min(min, x1+j+tn/j);
                    //OUT(x1)SP OUT(j)SP OUT(tn/j)BR;
                }
            }
        }
    }

    OUT(min-3)SP OUT(n-1)BR;
    //}());
    return 0;
}