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

long long order (long long n)
{
	return (-1 + sqrt(8*n+1)) / 2;
}

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

	long long res = 0;

	for (long long i = 2; i*i <= n; ++i)
	{	
		long long ctr = 0;
		while (n % i == 0)
		{
			ctr++;
			n /= i;
		}
		res += order(ctr);
	}

	if (n > 1) res++;
	cout << res << '\n';
	return 0;
}