#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #define all(x) (x).begin(),(x).end() #define rep(i,m,n) for(int i = m;i < n;++i) #define pb push_back #define fore(i,a) for(auto &i:a) #define rrep(i,m,n) for(int i = m;i >= n;--i) #define INF INT_MAX/2 using namespace std; using ll = long long; using R = double; using Data = pair>; const ll MOD = 1e9 + 7; const ll inf = 1LL << 50; struct edge { ll from; ll to; ll cost; }; vectordev; void devisor(ll n) { for (ll i = 1; i*i <= n; i++) { if (n%i == 0) { if (i == n / i) { dev.push_back(i); } else { dev.push_back(i); dev.push_back(n / i); } } } } int main() { ll n; cin >> n; devisor(n); sort(all(dev)); ll Tmax = -INF; ll Tmin = INF; rep(i, 0, dev.size()) { ll a = dev[i]; rep(j, i, dev.size()) { ll b = dev[j]; rep(k, j, dev.size()) { ll c = dev[k]; if (a*b*c != n)continue; Tmax = max(Tmax,a+b+c-3); Tmin = min(Tmin,a+b+c-3); } } } cout << Tmin << " " << Tmax << endl; return 0; }