#include <bits/stdc++.h>
using namespace std;
int p[(10000010)];
vector<long long> pp;
long long n;
int main() {
  for (int i = 0; i < (10000010); i++) {
    p[i] = 1;
  }
  for (int i = 2; i < (10000010); i++) {
    if (p[i]) {
      long long j = 2 * i;
      while (j < (10000010)) {
        p[j] = 0;
        j += i;
      }
    }
  }
  cin >> n;
  for (int i = 2; i < (10000010); i++) {
    if (p[i]) {
      long long cur = i;
      while (cur <= n) {
        pp.push_back(cur);
        cur *= i;
      }
    }
  }
  sort(pp.begin(), pp.end());
  int ret = 0;
  for (int i = 0; i < pp.size(); i++) {
    if ((n % pp[i]) == 0) {
      n /= pp[i];
      ret++;
    }
  }
  int bp = 1;
  for (long long i = 2; i * i <= n; i++) {
    if ((n % i) == 0) {
      bp = 0;
      break;
    }
  }
  if ((n > 1) && (n >= (10000010))) {
    ret += bp;
  }
  cout << ret;
  return 0;
}
