#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(const auto& i : v){std::cout << i << " ";}std::cout << "\n";}
#define SHOWVECTOR2(v) {std::cout << #v << "\t:\n";for(const auto& i : v){for(const auto& j : i){std::cout << j << " ";}std::cout << "\n";}}
#define SHOWPAIRVECTOR(v) {for(const 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;

std::vector<ll> Div(ll n){
	std::vector<ll> res;
	for(ll i=1; i*i<=n; ++i){
	   if(n%i==0){
           res.push_back(i);
           if(i*i!=n){
               res.push_back(n/i);
           }
       }
    }
    std::sort(ALL(res));
    return res;
}

signed main(){
    INIT;
    //CHECKTIME([&](){
    
    VAR(ll, n);
    std::vector<ll> v = Div(n);
    ll min = INF;
    int a = std::distance(std::begin(v), std::upper_bound(ALL(v), std::pow(n, 1.0/3)));
    REP(i, a+1){
        REP(j, a+1){
            if(n/v[i]%v[j]==0){
                min = std::min(min, v[i]+v[j]+n/v[i]/v[j]-3);
            }
        }
    }
    OUT(min)SP OUT(n-1)BR;
    //}());
    return 0;
}