Go: package main

import (
	"fmt"
	"math"
)

func main() {
	var on int
	fmt.Scan(&on)
	m := make(map[int]int)
	loop := true
	n := on
	for loop {
		loop = false
		for i := 2; i <= int(math.Sqrt(float64(n))); i++ {
			if n%i == 0 {
				m[i]++
				n /= i
				loop = true
				break
			}
		}
	}
	if n != 1 {
		m[n]++
	}

	var cnt int
	for i := 1; i <= int(math.Sqrt(float64(on))); i++ {
		if on%i == 0 {
			if on/i == i {
				cnt++
			} else {
				cnt += 2
			}
		}
	}

	fmt.Printf("%d %d\n", len(m), cnt-1)
}

C++: #include "bits/stdc++.h"
#include<vector>
#include<iostream>
#include<queue>
#include<algorithm>
#include<map>
#include<set>
#include<iomanip>
#include<assert.h>
#include<unordered_map>
#include<unordered_set>
#include<string>
#include<stack>
#include<complex>
#pragma warning(disable:4996)
using namespace std;
using ld = long double;
template<class T>
using Table = vector<vector<T>>;
const ld eps=1e-9;
	
#define WHATS(var)//cout<<__LINE__<<' '<<#var<<"="<<var<<endl;
	
template<class S, class T> ostream& operator <<(ostream &os, const pair<S, T> v){
	os << "( " << v.first << ", " << v.second << ")"; return os;
}
template<class T> ostream& operator <<(ostream &os, const vector<T> &v){
	for(int i = 0; i < v.size(); i++){if(i > 0){os << " ";} os << v[i];} return os;
}
template<class T> ostream& operator <<(ostream &os, const vector<vector<T>> &v){
	for(int i = 0; i < v.size(); i++){if(i > 0){os << endl;} os << v[i];} return os;
}
template<class T> ostream& operator <<(ostream &os, const vector<set<T>> &v){
	for(int i = 0; i < v.size(); i++){if(i > 0){os << endl;} os << v[i];} return os;
}
template<class T> ostream& operator <<(ostream &os, const set<T> &v){
	int i=0;
	for(auto it:v){
		if(i > 0){os << ' ';}
		os << it;
		i++;
	} 
	return os;
}

map<long long int, int>soinnsuu(long long int a) {
	map<long long int, int>ans;
	for (long long i = 2; i*i <= a; ++i) {
		while (a%i == 0) {
			ans[i]++;
			a /= i;
		}
	}
	if (a != 1)ans[a]++;


	return ans;
}
	
int main() {
	ios::sync_with_stdio(false);
	long long  N;cin>>N;
	auto sos=soinnsuu(N);
	int amin=-1;
	amin=sos.size();
	int amax=1;
	for(auto m:sos)amax*=m.second+1;

	cout<<amin<<' '<<amax-1<<endl;
	return 0;	
}

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

map<long long, int> prime_factor(long long n) {
    map<long long, int> res;
    for (long long i = 2; i * i <= n; i++) {
        while (n % i == 0) {
            n /= i;
            res[i]++;
        }
    }
    if (n != 1) res[n] = 1;
    return res;
}

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

int main() {
    long long N;
    cin >> N;
    cout << prime_factor(N).size() << " " << divisor(N).size() - 1 << endl;
}

C++: #include<bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define HUGE_NUM 99999999999999999
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;


int main(){

	ll N;
	scanf("%lld",&N);

	int count = 0; //1以外の約数の数
	queue<int> Q;

	if(N%2 == 0){

		int tmp = 0;

		while(N%2 == 0){ //次数を数える
			N /= 2;
			tmp++;
		}

		count++;
		Q.push(tmp);
	}

	for(ll i = 3; i*i <= N; i += 2){

		if(N%i == 0){

			int tmp = 0;

			while(N%i == 0){
				N /= i;
				tmp++;
			}

			count++;

			Q.push(tmp);
		}
	}

	if(count == 0){ //素数

		printf("1 1\n");

	}else{

		if(N != 1){

			count++;
			Q.push(1); //★
		}

		int maximum,minimum;

		if(count == 1){ //素因数が1つ

			minimum = 1; //2番目に小さい約数
			maximum = Q.front();

		}else{

			minimum = count;
			maximum = 1;

			while(!Q.empty()){ //N以外の数を昇順に宣言する
				maximum *= (Q.front()+1);
				Q.pop();
			}
			maximum--;
		}

		printf("%d %d\n",minimum,maximum);
	}

	return 0;
}