#include <bits/stdc++.h>
using namespace std;
long long n;
int s[10000010], ma = 0, cnt;

int main() {
	cin >> n;
	while (n != 1) {
		bool k = 1;
		for (int i = 2; i <= sqrt(n); i++) {
			if (n % i == 0) {
				k = 0;
				ma = max(ma, i);
				s[i]++;
				n /= i;
				break;
			}
		}
		if (k) {
			s[n]++;
			if (n > ma)
				ma = n;
			break;
		}

	}
	for (int i = 2; i <= ma; i++) {
		for (int j = 1; j <= s[i]; j++) {
			s[i] -= j;
			cnt++;
		}
	}
	cout << cnt;
	return 0;
}