#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define max(a, b) ((a) > (b) ? (a) : (b))
#define min(a, b) ((a) < (b) ? (a) : (b))
typedef long long ll;

ll ans = 0, cnt = 0, flag = 0, tmp = 0, pre = 0;
ll prime_factorization(ll a)
{
    ll i, sq;

    if (a % 2 == 0)
    {
        cnt++;
        if (cnt > tmp)
        {
            ans++;
            tmp++;
            cnt = 0;
        }
        //printf("first a:%lld cnt:%lld ans:%lld\n", a, cnt, ans);
        return prime_factorization(a / 2);
    }
    if (flag == 0)
    {
        cnt = 0;
        tmp = 0;
        flag = 1;
    }

    sq = sqrt(a);
    for (i = 3; i <= sq; i += 2)
    {
        if (a % i == 0)
        {
            if (pre != i)
            {
                tmp = 0;
                pre = i;
            }
            cnt++;
            if (cnt > tmp)
            {
                ans++;
                tmp++;
                cnt = 0;
            }
            //printf("second a:%lld cnt:%lld ans:%lld prime:%lld\n", a, cnt, ans, i);
            return prime_factorization(a / i);
        }
    }

    if (a != 1)
    {
        if (a != pre)
            ans++;
        if (cnt > tmp)
            ans++;
        //printf("third a:%lld cnt:%lld ans:%lld\n", a, cnt, ans);
    }

    printf("%lld", ans);
    return 0;
}

int main(void)
{
    ll n;
    int ans = 0;
    scanf("%lld", &n);

    prime_factorization(n);
    return 0;
}