#include <bits/stdc++.h>
#include <string>
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <bitset>
typedef long long ll;
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
 
const int mod = 1000000007;
 
struct mint {
  ll x; // typedef long long ll;
  mint(ll x=0):x((x%mod+mod)%mod){}
  mint operator-() const { return mint(-x);}
  mint& operator+=(const mint a) {
    if ((x += a.x) >= mod) x -= mod;
    return *this;
  }
  mint& operator-=(const mint a) {
    if ((x += mod-a.x) >= mod) x -= mod;
    return *this;
  }
  mint& operator*=(const mint a) { (x *= a.x) %= mod; return *this;}
  mint operator+(const mint a) const { return mint(*this) += a;}
  mint operator-(const mint a) const { return mint(*this) -= a;}
  mint operator*(const mint a) const { return mint(*this) *= a;}
  mint pow(ll t) const {
    if (!t) return 1;
    mint a = pow(t>>1);
    a *= a;
    if (t&1) a *= *this;
    return a;
  }
 
  // for prime mod
  mint inv() const { return pow(mod-2);}
  mint& operator/=(const mint a) { return *this *= a.inv();}
  mint operator/(const mint a) const { return mint(*this) /= a;}
};
istream& operator>>(istream& is, const mint& a) { return is >> a.x;}
ostream& operator<<(ostream& os, const mint& a) { return os << a.x;}
 
 
struct combination {
  vector<mint> fact, ifact;
  combination(int n):fact(n+1),ifact(n+1) {
    assert(n < mod);
    fact[0] = 1;
    for (int i = 1; i <= n; ++i) fact[i] = fact[i-1]*i;
    ifact[n] = fact[n].inv();
    for (int i = n; i >= 1; --i) ifact[i-1] = ifact[i]*i;
  }
  mint operator()(int n, int k) {
    if (k < 0 || k > n) return 0;
    return fact[n]*ifact[k]*ifact[n-k];
  }
};
 
ll M = 1000000000000000000;
 
vector<pair<long long, long long> > prime_factorize(long long N) {
    vector<pair<long long, long long> > res;
    for (long long a = 2; a * a <= N; ++a) {
        if (N % a != 0) continue;
        long long ex = 0; // 指数

        // 割れる限り割り続ける
        while (N % a == 0) {
            ++ex;
            N /= a;
        }

        // その結果を push
        res.push_back({a, ex});
    }

    // 最後に残った数について
    if (N != 1) res.push_back({N, 1});
    return res;
}

//int main() {
//    long long N;
//    cin >> N;
//    const auto &res = prime_factorize(N);
//    cout << N << ":";
//    for (auto p : res) {
//        for (int i = 0; i < p.second; ++i) cout << " " << p.first;
//    }
//    cout << endl;
//}
int main(int argc, const char * argv[]) {
    long long N; cin >> N;
    vector<pair<long long, long long>> res = prime_factorize(N);
    
    ll temp=1;
    vector<ll> ANS;
    ll before = 1;
    for (auto p : res) {
        for (int i = 0; i < p.second; ++i){
            if(i==0){
                before = p.first;
                temp = p.first;
                ANS.push_back(temp);
            }
            else{
                if(before != p.first){
                    temp = p.first;
                    before = p.first;
                    ANS.push_back(temp);
                }
                else{
                    temp *= p.first;
                    before = p.first;
                    ANS.push_back(temp);
                }
            }
        }
    }
    
    if(ANS.empty()){
        cout << 0 << endl;
        return 0;
    }
    


    sort(ANS.begin(),ANS.end());
    
    ll cnt=0;
    for(ll i=0;i<ANS.size();i++){
        if(N%ANS[i]==0){
            cnt++;
            N = N / ANS[i];
        }
    }
    cout << cnt << endl;
    return 0;

}


Measured memory_bytes: 3636