#include <bits/stdc++.h>
#define ll long long
#define N 1000000

using namespace std;
ll n, nt[N + 1]; 

void spf()
{
     nt[1] = 1; 
     for(int i = 2; i*i <= N; i++)
     {     
          if(nt[i] == 0) 
          {
            nt[i] = i; 
            if(1LL*i*i <= N)
            {
                for(int j = i*i; j <= N; j+= i)
                {
                    if(nt[j] == 0) nt[j] = i; 
                }
            }
          }
     }
     for(int i = 2; i <= N; i++) if(nt[i] == 0) nt[i] = i;
}

ll calc(ll x)
{
     ll cnt = 0;
     while(x > 1)
     {
           ll p = nt[x];   
                cnt++; 
                while(x % p == 0) x /=p; 
     }
     return cnt;
}

int main() 
{
      spf();
      cin >> n; 

      cout << calc(n) << '\n'; 
}