#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
using ll = long long;
#define rep(i, n) for (ll i = 0; i < (n); i++)
using namespace std;

ll prime(ll n, vector<ll> &s, ll num){
  ll count = 0;
  bool flag = false;
  while(n % num == 0){
    flag = true;
    count++;
    n /= num;
  }
  if (flag) s.push_back(count);
  return n;
}

int main(){
  ll n;
  cin >> n;
  vector<ll> count;
  n = prime(n, count, 2);
  ll ans = 0;
  for(ll i = 3; i <= n; i+=2){
    n = prime(n, count, i);
  }
  for(ll x : count){
    ll beki = 4;
    x -= 3;
    ans++;
    while(x >= 0){
      ans++;
      x -= beki;
      beki++;
    }
  }
  cout << ans << endl;
  
  return 0;
}