#include<cstdio>
#include<queue>
#include<utility>
#include<cstring>
#include<stack>
#include<algorithm>
#include<cmath>
#include<iostream>
#include<map>
#define MAX_N 100001
#define INF_INT 2147483647
#define INF_LL 9223372036854775807
#define REP(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> P;
void init(int n);
int find(int n);
void unite(int x,int y);
bool same(int x, int y);
ll bpow(ll,ll,ll);
typedef vector<int> vec;
typedef vector<vec> mat;
mat mul(mat &A,mat &B);
mat pow(mat A,ll n);
int dx[4] = {1,0,0,-1};
int dy[4] = {0,1,-1,0};


bool cmp_P(const P &a,const P &b){
  return a.second < b.second;
}

bool isPrime(ll N){
  ll sqr = sqrt(N)+1;
  if(N == 2)
    return true;
  if(N % 2 == 0)
    return false;
  for(int i=3;i<=sqr;i+=2){
    if(!(N % i))
      return false;
  }
  return true;
}

int main()
{
  ll Tmin,Tmax,N,d=0,cnt=0,shoki,res=0;
  double sqr;
  cin >> N;
  Tmax = N - 1;
  Tmin = N - 1;
  shoki = N;
  sqr = sqrt(N)+1;
  vector<ll> insu(0);
  vector<ll> soinsu(0);
  if(N == 2){
    cout << 1 << " " << 1 << endl;
    return 0;
  }
  for(int i=2;i<=sqr;i++){
    if((N % i) == 0){
      insu.push_back(i);
      if(N/i != i)
        insu.push_back(N/i);
    }
  }
  REP(i,insu.size()){
    if(isPrime(insu[i])){
      soinsu.push_back(insu[i]);
    }
  }
  sort(soinsu.begin(),soinsu.end());
  soinsu.erase(unique(soinsu.begin(),soinsu.end()),soinsu.end());
  REP(i,soinsu.size()){
    d = N;
    cnt = 0;
    while(d % soinsu[i] == 0){
      d /= soinsu[i];
      cnt++;
    }
    res += cnt*(soinsu[i]-1);
  }
  if(res == 0)
    Tmin = Tmax;
  else
    Tmin = res;
  cout << Tmin << " " << Tmax << endl;
  return 0;
}

int par[MAX_N];
int ranks[MAX_N];

//n要素で初期化
void init(int n){
  REP(i,n){
    par[i] = i;
    ranks[i] = 0;
  }

}

//木の根を求める
int find(int x){
  if(par[x] == x){
    return x;
  }else{
    return par[x] = find(par[x]);
  }
}

void unite(int x,int y){
  x = find(x);
  y = find(y);
  if(x == y) return ;
  if(ranks[x] < ranks[y]){
    par[x] = y;
  }else{
    par[y] = x;
    if(ranks[x] == ranks[y]) ranks[x]++;
  }
}

bool same(int x, int y){
  return find(x) == find(y);
}

ll bpow(ll a, ll n,ll mod){
  int i = 0;
  ll res=1;
  while(n){
    if(n & 1)
      res = (res*a) % mod;
    a = (a*a) % mod;
    n >>= 1;
  }
  return res;
}
const int MOD = 1000000007;
mat mul(mat &A, mat &B){
  mat C(A.size(),vec(B[0].size()));
    REP(i,A.size())REP(k,B.size())REP(j,B[0].size()){
    C[i][j] = (C[i][j] + A[i][k] * B[k][j]) % MOD;
  }
  return C;
}

mat pow(mat A,ll n)
{
  mat B(A.size(),vec(A.size()));
  REP(i,A.size()){
    B[i][i] = 1;
  }
  while(n > 0){
    if ( n & 1) B = mul(B,A);
    A = mul(A,A);
    n >>= 1;
  }
  return B;
}