#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <vector>
#include <iomanip>
#include <sstream>
#include <bitset>
#include <unordered_map>
// #include <bits/stdc++.h>
#define ALL(x) (x).begin(), (x).end()
#define sz(a) int(a.size())
#define rep(i,x,n) for(int i=x;i<n;i++)
#define repd(i,x,n) for(int i=x;i<=n;i++)
#define pii pair<int,int>
#define pll pair<long long ,long long>
#define gbtb ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define MS0(X) memset((X), 0, sizeof((X)))
#define MSC0(X) memset((X), '\0', sizeof((X)))
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define eps 1e-6
#define chu(x)  if(DEBUG_Switch) cout<<"["<<#x<<" "<<(x)<<"]"<<endl
#define du3(a,b,c) scanf("%d %d %d",&(a),&(b),&(c))
#define du2(a,b) scanf("%d %d",&(a),&(b))
#define du1(a) scanf("%d",&(a));
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) {return b ? gcd(b, a % b) : a;}
ll lcm(ll a, ll b) {return a / gcd(a, b) * b;}
ll powmod(ll a, ll b, ll MOD) { if (a == 0ll) {return 0ll;} a %= MOD; ll ans = 1; while (b) {if (b & 1) {ans = ans * a % MOD;} a = a * a % MOD; b >>= 1;} return ans;}
ll poww(ll a, ll b) { if (a == 0ll) {return 0ll;} ll ans = 1; while (b) {if (b & 1) {ans = ans * a ;} a = a * a ; b >>= 1;} return ans;}
void Pv(const vector<int> &V) {int Len = sz(V); for (int i = 0; i < Len; ++i) {printf("%d", V[i] ); if (i != Len - 1) {printf(" ");} else {printf("\n");}}}
void Pvl(const vector<ll> &V) {int Len = sz(V); for (int i = 0; i < Len; ++i) {printf("%lld", V[i] ); if (i != Len - 1) {printf(" ");} else {printf("\n");}}}
inline long long readll() {long long tmp = 0, fh = 1; char c = getchar(); while (c < '0' || c > '9') {if (c == '-') fh = -1; c = getchar();} while (c >= '0' && c <= '9') tmp = tmp * 10 + c - 48, c = getchar(); return tmp * fh;}
inline int readint() {int tmp = 0, fh = 1; char c = getchar(); while (c < '0' || c > '9') {if (c == '-') fh = -1; c = getchar();} while (c >= '0' && c <= '9') tmp = tmp * 10 + c - 48, c = getchar(); return tmp * fh;}
void pvarr_int(int *arr, int n, int strat = 1) {if (strat == 0) {n--;} repd(i, strat, n) {printf("%d%c", arr[i], i == n ? '\n' : ' ');}}
void pvarr_LL(ll *arr, int n, int strat = 1) {if (strat == 0) {n--;} repd(i, strat, n) {printf("%lld%c", arr[i], i == n ? '\n' : ' ');}}
const int maxn = 2000010;
const int inf = 0x3f3f3f3f;
/*** TEMPLATE CODE * * STARTS HERE ***/
#define DEBUG_Switch 0

bool noprime[maxn + 50];
vector <int> p;
int getPrime()
{
    // 华丽的初始化
    memset(noprime, false, sizeof(noprime));
    p.clear();

    int m = (int)sqrt(maxn + 0.5);
    // 优化的埃筛
    for (int i = 2; i <= m; i++)
    {
        if (!noprime[i])
        {
            for (int j = i * i; j <= maxn; j += i)
            {
                noprime[j] = true;
            }
        }
    }
    // 把素数加到vector里
    for (int i = 2; i <= maxn; i++)
    {
        if (!noprime[i])
        {
            p.push_back(i);
        }
    }
    //返回vector的大小
    return p.size();

}
ll pf[105][2];// 0 -> value 1->count

int getPrifac( ll n, int len)
{
    int pos = 0;
    for (int i = 0; 1ll * p[i]*p[i] <= n && i < len; i++)
    {
        if ( n % p[i] == 0)
        {
            pf[++pos][0] = p[i];
            pf[pos][1] = 0;
            // 算质因数的幂数
            while (n % p[i] == 0)
            {
                pf[pos][1]++;
                n /= p[i];
            }
        }
    }
    if ( n > 1)
    {
        pf[++pos][0] = n;
        pf[pos][1] = 1;
    }
    return pos; // 优美的返回有多少个质因数
    // 1~pos
}
ll dp[100];
int main()
{
#if DEBUG_Switch
    freopen("C:\\code\\input.txt", "r", stdin);
#endif
    //freopen("C:\\code\\output.txt","r",stdin);
    int len = getPrime();
    ll n = readll();
    int cnt = getPrifac(n, len);
    dp[1] = 1ll;
    int x = 1;
    int num = 1;
    repd(i, 2, 100)
    {
        x += i;
        if (x >= 100)
        {
            break;
        }
        dp[x] = ++num;
    }
    repd(i, 1, 100)
    {
        if (dp[i])
        {
            x = dp[i];
        } else
        {
            dp[i] = x;
        }
    }
    ll ans = 0ll;
    repd(i, 1, cnt)
    {
        // chu(pf[i][1]);
        ans += dp[pf[i][1]];
    }
    printf("%lld\n", ans );
    return 0;
}




Measured memory_bytes: 6116