Go: package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
)

// I/O
type Scanner struct {
	sc *bufio.Scanner
}

func NewScanner() *Scanner {
	sc := bufio.NewScanner(os.Stdin)
	sc.Split(bufio.ScanWords)
	sc.Buffer(make([]byte, 1024), int(1e+9))
	return &Scanner{sc}
}

func (s *Scanner) nextStr() string {
	s.sc.Scan()
	return s.sc.Text()
}

func (s *Scanner) nextInt() int {
	i, e := strconv.Atoi(s.nextStr())
	if e != nil {
		panic(e)
	}
	return i
}

func (s *Scanner) nextFloat() float64 {
	f, e := strconv.ParseFloat(s.nextStr(), 64)
	if e != nil {
		panic(e)
	}
	return f
}

func (s *Scanner) nextRuneSlice() []rune {
	return []rune(s.nextStr())
}

func (s *Scanner) nextIntSlice(n int) []int {
	res := make([]int, n)
	for i := 0; i < n; i++ {
		res[i] = s.nextInt()
	}
	return res
}

func (s *Scanner) nextFloatSlice(n int) []float64 {
	res := make([]float64, n)
	for i := 0; i < n; i++ {
		res[i] = s.nextFloat()
	}
	return res
}

// Arithmetic
func max(nums ...int) int {
	m := nums[0]
	for _, i := range nums {
		if m < i {
			m = i
		}
	}
	return m
}

func min(nums ...int) int {
	m := nums[0]
	for _, i := range nums {
		if m > i {
			m = i
		}
	}
	return m
}

func abs(x int) int {
	if x > 0 {
		return x
	}
	return -x
}

func pow(x, y int) int {
	res := 1
	for i := 0; i < y; i++ {
		res *= x
	}
	return res
}

// Sort
type Val struct {
	id, num int
}
type ByNum []Val

func (a ByNum) Len() int           { return len(a) }
func (a ByNum) Less(i, j int) bool { return a[i].num < a[j].num }
func (a ByNum) Swap(i, j int)      { a[i], a[j] = a[j], a[i] }

func divisor(n int) []int {
	res := []int{}
	for i := 1; i*i <= n; i++ {
		if n%i == 0 {
			res = append(res, i)
			if i*i != n {
				res = append(res, n/i)
			}
		}
	}
	return res
}

func primeFactors(n int) map[int]int {
	pfs := make(map[int]int)
	for n%2 == 0 {
		pfs[2]++
		n = n / 2
	}
	for i := 3; i*i <= n; i = i + 2 {
		for n%i == 0 {
			pfs[i]++
			n = n / i
		}
	}
	if n > 2 {
		pfs[n]++
	}

	return pfs
}

func main() {
	sc := NewScanner()
	wtr := bufio.NewWriter(os.Stdout)
	N := sc.nextInt()

	fmt.Fprintln(wtr, len(primeFactors(N)), len(divisor(N))-1)
	wtr.Flush()
}

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

typedef long long ll;
typedef unsigned long long ull;

vector<ll> divisor(ll n) {
  vector<ll> ret;
  for(ll i = 1; i * i <= n; i++) {
    if(n % i == 0) {
      ret.push_back(i);
      if(i * i != n) ret.push_back(n / i);
    }
  }
  sort(begin(ret), end(ret));
  return ret;
}

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

  auto v = divisor(n);

  vector<ll> c;
  for (ll i = v.size()-2; i >= 0; --i) {
    bool ok = true;
    for (ll j = 0; j < c.size(); ++j) {
      if (c[j] % v[i] == 0) {
        ok = false;
        break;
      }
    }
    if (ok) {
      c.push_back(v[i]);
    }
  }

  cout << c.size() << " " << v.size() - 1 << endl;
    
  return 0;
}

C++: #include <bits/stdc++.h>
#define int long long
using namespace std;

int N;

signed main(){
  
  cin>>N;
  
  set<int> div;
  
  for(int i=1;i*i<=N;i++){
    
    if( N % i == 0 ){
      div.insert(i);
      div.insert(N/i);
    }
    
  }
  
  vector<int> D;
  
  for(auto p : div ){
    if( p != N ) D.push_back(p);
  }
  
  int minv = 0;
  
  set<int> del;
  
  for(int i=(int)D.size()-1;i>=0;i--){
    
    if( del.count(D[i]) == 0 ){
      
      minv++;
      
      for(int j=i-1;j>=0;j--){
	
	if( D[i] % D[j] == 0 ){
	  del.insert(D[j]);
	}
	
      }
      
    }
    
  }
  
  cout<<minv<<' '<<D.size()<<endl;
  
  
  return 0;
}

C++: #include<iostream>
using namespace std;
#define int long long
signed main(){
    long long n;
    cin >> n;
    int tmp = n;

    int cnt = 0;
    for(int i = 2; i*i <= n; i++){
        if(n%i == 0){
            cnt++;
            while(n%i == 0)n /= i;
        }
    }
    if(n > 1){
        //nが1以上のとき、Nは√Nより大きい素因数をもつ
        cnt++;
    }

    cout << cnt << " ";
    n = tmp;
    cnt = 0;
    for(long long i = 1; i*i <= n; i++){
        if(n%i == 0){ //iはnの約数
            cnt++;
            if(i*i != n)cnt++;//n/iの分もカウントする
        }
    }

    cout << cnt-1 << endl;
}

C++: #include <iostream>
#include <vector>
#include <algorithm>
#include <utility>
using namespace std;
typedef long long int lli;

vector<pair<lli, lli> > factoring(lli n){
	vector<pair<lli, lli> > res;
	for(lli i=2; i*i<=n; i++){
		if(n%i == 0){
			res.emplace_back(i, 0);
			while(n%i == 0){
				n /= i;
				res.back().second++;
			}
		}
	}
	if(n != 1){
		res.emplace_back(n, 1);
	}
	return res;
}

int main(){
	lli n;
	cin >> n;
	auto fact = factoring(n);
	lli numfact = 1;
	for(auto p: fact){
		numfact *= p.second +1;
	}
	cout << fact.size() << " " << numfact-1 << endl;
	return 0;
}

C++: #include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
const int INF=1e9,MOD=1e9+7;
const ll LINF=1e18;
using namespace std;
#define int long long

signed main(){
  int N;cin>>N;
  map<int,int> m;
  for(int i=2;i*i<=N;i++){
    if(N%i==0){
      m[i]++;
      N/=i;
      i=1;
    }
  }
  m[N]++;
  cout<<m.size()<<" ";
  int ans=1;
  for(auto p:m)ans*=(p.second+1);
  cout<<ans-1<<endl;
}

C++: #include<bits/stdc++.h>
#define FOR(i, a, b) for (int i = a; i < b; ++i)
#define rep(N) for (int i = 0; i < N; ++i)
#define Rep(a, b) for (int i = a; i < b; ++i)
#define For(i, N) for (int i = 0; i < N; ++i)
#define all(v) v.begin(), v.end()
#define rev(v) v.rbegin(), v.rend()
#define makei(N) int N; cin >> N;
#define makel(N) ll N; cin >> N;
#define makes(s) string s; cin >> s;
#define maked(d) double d; cin >> d;
#define makev(v, N) vi v(N); rep(N)cin >> v[i];
#define mod 1000000007
#define distance(x1,y1,x2,y2) sqrt((x1 - x2)*(x1 - x2) + (y1 - y2)*(y1 - y2));

using namespace std;
using ll = long long int;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vll = vector<ll>;
using vb = vector<bool>;
using vvb = vector<vector<bool>>;
using vs = vector<string>;
using pii = pair<int, int>;
using pis = pair<int, string>;
using msi = map<string, int>;

template<typename T>
void say(T s) {
	cout << s << "\n";
}

template<typename T>
void say(vector<T> s) {
	auto itr = s.begin();
	if (itr == s.end())return;
	cout << *(itr++);
	while (itr != s.end()) {
		cout << " " << *(itr++);
	}
	cout << "\n";
}

void yn(bool b) {
	if (b)say("yes");
	else say("no");
}

void Yn(bool b) {
	if (b)say("Yes");
	else say("No");
}

void YN(bool b) {
	if (b)say("YES");
	else say("NO");
}

template<typename T>
void maxi(T& a, T b) {
	a = max(a, b);
}

template<typename T>
void mini(T& a, T b) {
	a = min(a, b);
}

void exact_say(double x) {
	cout << setprecision(numeric_limits<double>::max_digits10) << x << endl;
}

template<class T> void getVector(vector<T>& v) {
	for (int i = 0; i < v.size(); ++i)
		cin >> v[i];
}

vector<ll> enum_div(ll n) {//約数列挙
	vector<ll> ans;
	for (ll i = 1; i * i <= n; ++i) {
		if (n % i == 0) {
			ans.push_back(i);
			if (i != 1 && i * i != n) {
				ans.push_back(n / i);
			}
		}
	}
	return ans;
}

int main() {
	ll n;
	cin >> n;
	vector<ll> st = enum_div(n);
	sort(all(st));
	ll Min = 0;
	ll Max = st.size();
	while (st.size() > 0) {
		Min++;
		ll a = st.back();
		st.erase(st.end() - 1);
		vector<ll> ay = enum_div(a);
		for (auto it = ay.begin(); it != ay.end(); ++it) {
			auto ity = equal_range(all(st), *it);
			st.erase(ity.first, ity.second);
		}
	}
	cout << Min << " " << Max << endl;
}