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

typedef long long ll;
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define each(itr,c) for(__typeof(c.begin()) itr=c.begin(); itr!=c.end(); ++itr)
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define fi first
#define se second

vector<ll> factorize(ll n)
{
    vector<ll> ret;

    ll t=n;
    for(ll i=2; i*i<=n; ++i)
    {
        while(t%i==0)
        {
            t/=i;
            ret.pb(i);
        }
    }
    if(t>1) ret.pb(t);
    sort(all(ret),greater<ll>());
    return ret;
}

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

    ll tmin=0,tmax=n-1;

    priority_queue<ll,vector<ll>,greater<ll>> que;
    rep(i,3) que.push(1);

    vector<ll> d=factorize(n);
    for(const auto &x:d)
    {
        ll v=que.top();
        que.pop();
        v*=x;
        que.push(v);
    }

    while(!que.empty())
    {
        ll v=que.top();
        que.pop();
        tmin+=v-1;
    }

    cout << tmin << " " << tmax << endl;
    return 0;
}