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

vector<int64_t> prime_factor(int64_t n){
    vector<int64_t> ret;
    for(int64_t i=2; i*i<=n; i++){
        if(n % i == 0){
            while(n % i == 0) n /= i;
            ret.push_back(i);
        }
    }
    if(n > 1) ret.push_back(n);
    return ret;
}

int main(){
    int64_t N;
    cin >> N;
    int mx = -1;
    for(int64_t i=1; i*i<=N; i++){
        if(N%i == 0){
            mx++;
            if(i < N/i) mx++;
        }
    }

    int mn = prime_factor(N).size();
    cout << mn << " " << mx << endl;
}

