#include <stdio.h>
#include <stdlib.h>
#include <math.h>

int *prime(const int max)
{
    int c, cc;
    int *ans;
    ans = (int *)malloc(sizeof(int) * (max + 1));
    for (c = 0; c <= max; c += 2)
    {
        ans[c] = 0;
    }
    for (c = 3; c <= max; c += 2)
    {
        ans[c] = c;
    }
    ans[2] = 2;
    for (c = 3; c <= sqrt(max) + 1; c += 2)
    {
        if (ans[c] == 0)
        {
            continue;
        }
        for (cc = 2; cc * c <= max; ++cc)
        {
            ans[c * cc] = 0;
        }
    }
    return ans;
}

int main(void)
{
    int *key;
    int c, ans = 0, power;
    long N;
    scanf("%ld", &N);
    key = prime((int)sqrt(N) + 2);
    for (c = 2; c <= (int)sqrt(N) + 2; ++c)
    {
        if (key[c] != 0)
        {
            power = 1;
            while (N % (int)(pow(c, power) + 0.1) == 0)
            {
                ++ans;
                N /= (int)(pow(c, power) + 0.1);
                ++power;
            }
        }
    }
    if (N != 1 && ans == 0)
    {
        ++ans;
    }
    printf("%d", ans);
    return 0;
}