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

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

int main() {
  long N;
  cin >> N;
  int ans = 0;
  for (auto [a, b] : pf(N)) {
    int now = 1;
    while (b - now >= 0) b -= now, ans++, now++;
  }
  cout << ans << "\n";
}