#include <bits/stdc++.h>
#ifdef LOCAL_DEBUG
#define DEBUG 1
#define CERR if(DEBUG) cerr
#define MACRO(_1,_2,_3,_4,_5,_6,_7,_8,_9,_10,NAME,...) NAME
#define pr(...) CERR<<MACRO(__VA_ARGS__,pr10,pr9,pr8,pr7,pr6,pr5,pr4,pr3,pr2,pr1)(__VA_ARGS__)<<endl
#define pr1(a) (#a)<<"="<<(a)<<" "
#define pr2(a,b) pr1(a)<<pr1(b)
#define pr3(a,b,c) pr1(a)<<pr2(b,c)
#define pr4(a,b,c,d) pr1(a)<<pr3(b,c,d)
#define pr5(a,b,c,d,e) pr1(a)<<pr4(b,c,d,e)
#define pr6(a,b,c,d,e,f) pr1(a)<<pr5(b,c,d,e,f)
#define pr7(a,b,c,d,e,f,g) pr1(a)<<pr6(b,c,d,e,f,g)
#define pr8(a,b,c,d,e,f,g,h) pr1(a)<<pr7(b,c,d,e,f,g,h)
#define pr9(a,b,c,d,e,f,g,h,i) pr1(a)<<pr8(b,c,d,e,f,g,h,i)
#define pr10(a,b,c,d,e,f,g,h,i,j) pr1(a)<<pr9(b,c,d,e,f,g,h,i,j)
#define prArr(a){CERR<<(#a)<<"={";int i=0;for(auto t:(a))CERR<<(i++?", ":"")<<t;CERR<<"}"<<endl;}
#else
#define DEBUG 0
#define pr(...)
#define prArr(a)
#endif
using namespace std;
using Int = long long;
using _int = int;
using ll = long long;
using Double = long double;
const Int INF = (1LL<<60)+1e9; // ~ 1.15 * 1e18
const Int mod = (1e9)+7;
const Double EPS = 1e-8;
const Double PI = 6.0 * asin((Double)0.5);
using P = pair<Int,Int>;
template<class T> T Max(T &a,T b){return a=max(a,b);}
template<class T> T Min(T &a,T b){return a=min(a,b);}
template<class T1, class T2> ostream& operator<<(ostream& o,pair<T1,T2> p){return o<<"("<<p.first<<","<<p.second<<")";}
template<class T1, class T2, class T3> ostream& operator<<(ostream& o,tuple<T1,T2,T3> t){return o<<"("<<get<0>(t)<<","<<get<1>(t)<<","<<get<2>(t)<<")";}
template<class T1, class T2> istream& operator>>(istream& i,pair<T1,T2> &p){return i>>p.first>>p.second;}
template<class T> ostream& operator<<(ostream& o,vector<T> a){Int i=0;for(T t:a)o<<(i++?" ":"")<<t;return o;}
template<class T> istream& operator>>(istream& i,vector<T> &a){for(T &t:a)i>>t;return i;}
//INSERT ABOVE HERE
class Math{
public:
  typedef long long ll;
  typedef pair<Int,Int> P;
  ll mod;
  Math(ll mod = 1e9+7):mod(mod){}

  ll mod_pow(ll a,ll x){
    ll res=1;
    while(x){
      if(x%2) res=res*a%mod;
      a=a*a%mod;
      x/=2;
    }
    return res;
  }

  //逆元
  ll inv(ll a){return mod_pow(a,mod-2);}

  //階乗関数
  ll K(Int i, Int n = 1e6){
    static vector<ll> k(n);
    if(!k[0]){k[0]=1;for(Int i=1;i<(Int)k.size();i++)k[i]=i*k[i-1]%mod;}
    return k[i];
  }

  ll nPr(ll n, ll r){return K(n) * inv(K(n-r)) % mod;}

  //O(log(mod))  階上テーブルを使うので、k,rが大きすぎるとダメ。
  ll nCr(ll n,ll r){
    ll a = inv( K(r) * K(n-r) % mod);
    return K(n) * a % mod;
  }

  //O(r + log(mod))
  ll nCr2(ll n,ll r){
    ll N = 1, K = 1;
    for(Int i=0;i<r;i++) N=N*((n-i)%mod)%mod;
    for(Int i=0;i<r;i++) K=K*((r-i)%mod)%mod;
    ll R = inv(K);
    return N*R%mod;
  }

  /*カーマイケル数ってなんだっけ忘れた*/
  static ll carmichaelLambda(ll n){
    ll res = 1;
    if(n % 8 == 0) n/=2;
    auto lcm = [](ll a,ll b){return (a/__gcd(a,b)) * b;};

    auto compute = [&](ll i){
      ll sub = i - 1;
      n/=i;
      while(n%i == 0) n/=i, sub *=i;
      res = lcm(res,sub);
    };

    for(Int i=2;i*i<=n;i++) if( n % i == 0) compute(i);
    if(n != 1) compute(n);
    return res;
  }

  //n以下の素数を返す。
  static vector<Int> getPrime(Int n){
    vector<bool>used(n+1,0);

    for(ll i=2;i*i<=n;i++)
      if(!used[i]) for(Int j=2;j<=n/i;j++) used[i*j]=1;

    vector<Int> res;
    for(Int i=2;i<=n;i++)if(!used[i]) res.push_back(i);

    return res;
  }

  //素数判定
  static bool isPrime(ll n){
    if(n < 2) return 0;
    for(ll i=2;i*i<=n;i++) if(n%i==0) return 0;
    return 1;
  }

  //素因数分解 x == 0 || x == 1のときはその値自身を返す。
  static vector<ll> primeFactor(ll x,Int flag = 0){
    if(flag == 0 && (x == 0 || x == 1)) return {x};
    if(flag == 1 && (x == 0 || x == 1)) return {};

    vector<ll> res;
    for(ll i=2;i*i <= x;i++)
      while(x%i == 0) x/=i, res.push_back(i);
    if(x != 1) res.push_back(x);
    return res;
  }

  static map<ll,ll> primeFactorMap(ll x,Int flag = 0){
    map<ll,ll> res;
    if(flag == 0 && (x == 0 || x == 1)) {res[x]++; return res;}
    if(flag == 1 && (x == 0 || x == 1)) return res;

    for(ll i=2;i*i <= x;i++) while(x%i == 0) x/=i, res[i]++;
    if(x != 1) res[x]++;
    return res;
  }

  static ll divisor_Sum(map<ll,ll> prime){ // first : prime  second : cnt
    ll res = 1;
    for(P p : prime){
      ll sum = 1, mul = p.first;
      for(ll i=0;i<p.second;i++) sum += mul, mul *= p.first;
      res *= sum;
    }
    return res;
  }

  static ll divisor_Sum(ll num){
    return divisor_Sum(primeFactorMap(num));
  }

  //約数列挙
  static vector<ll> divisor(ll x){
    vector<ll> res;
    for(ll i=1; i*i<=x ;i++)
      if(x%i==0){
        res.push_back(i);
        if(i*i!=x) res.push_back(x/i);
      }
    sort(res.begin(), res.end());
    return res;
  }

  //a * bがオーバフローするか判定
  static bool overflow(ll a,ll b){return a > LONG_MAX/b;}

};


signed main(){
  srand((unsigned)time(NULL));
  cin.tie(0);
  ios_base::sync_with_stdio(0);
  cout << fixed << setprecision(12);

  Int N;
  cin>>N;
  if(N == 1){
    cout<<0<<endl;
    return 0;
  }

  auto cnt = Math::primeFactorMap(N);
  Int ans = 0;
  for(auto p:cnt){
    Int a, num; tie(a, num) = p;
    Int t = 1;
    while(num >= t){
      num -= t;
      t++;
      ans++;
    }
  }
  cout<<ans<<endl;
  return 0;
}


Measured memory_bytes: 3656