// #pragma GCC target   ("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
// #pragma GCC optimize ("Ofast,no-stack-protector")
// #pragma GCC optimize ("unroll-loops")
// #pragma GCC optimize ("fast-math")
// #pragma comment(linker, "/stack:200000000")

#include<bits/stdc++.h>
using namespace std;

typedef long long int      ll;
typedef long double        ld;
typedef unsigned long long ull;
typedef vector<ll>         vl;
typedef vector<vl>         vvl;
typedef pair<ll,ll>        pll;
typedef vector<pll>        vpll;

#define ff          first
#define ss          second
#define pb          push_back
#define mp          make_pair
#define eb          emplace_back
#define fr(i,n)     for(ll i = 0; i < n; ++i)
#define frs(i,s,n)  for(ll i = s; i < n; ++i)
#define frb(i,s,e)  for(ll i = s; i <= e; ++i)
#define rfr(i,n)    for(ll i = n-1; i >= 0; i--)
#define frbr(i,e,s) for(ll i = e; i >= s; i--)
#define all(x)      (x).begin(), (x).end()
#define sz(x)       ((ll)(x).size())

inline void __print(int x) {cerr << x;}
inline void __print(long x) {cerr << x;}
inline void __print(long long x) {cerr << x;}
inline void __print(unsigned x) {cerr << x;}
inline void __print(unsigned long x) {cerr << x;}
inline void __print(unsigned long long x) {cerr << x;}
inline void __print(float x) {cerr << x;}
inline void __print(double x) {cerr << x;}
inline void __print(long double x) {cerr << x;}
inline void __print(char x) {cerr << '\'' << x << '\'';}
inline void __print(const char *x) {cerr << '\"' << x << '\"';}
inline void __print(const string &x) {cerr << '\"' << x << '\"';}
inline void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
inline void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
inline void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
inline void _print() {cerr << "]\n";}
template <typename T, typename... V>
inline void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}

clock_t startTime;
inline double getCurrentTime() {return ((double)(clock() - startTime)) / CLOCKS_PER_SEC;} 

#ifdef LOCAL
#define dbg(x...)      {cerr << "[" << #x << "] = ["; _print(x);}
#define dbg_arr(a,n)   {cerr << "[" << #a << "] = [ ";fr(i,n)cerr<<a[i]<<" ";cerr<<"]\n";}
#define dbg_mat(m,r,c) {cerr<<"[" <<#m<<"]:\n";fr(i,r){cerr<<"[ ";fr(j,c)cerr<<m[i][j]<<" ";cerr<<"]\n";}}
#define dbg_time()     {cerr<<endl<<"Time elapsed: "<<getCurrentTime()<<endl<<endl<<endl;}
#else
#define dbg(x...)      {}
#define dbg_arr(a,n)   {}
#define dbg_mat(m,r,c) {}
#define dbg_time()     {}
#endif

const ld PI   = acos(-1);
const ld EPS  = 1e-9;
const ll MOD  = 1e9+7; // 998244353;
const ll INF  = 1e18;
const ll SINF = 1e9;
const ll MAX  = 100100;

vpll fact(ll n) 
{ 
  vpll v;
  ll count = 0; 
  while (!(n % 2)) 
  { 
    n >>= 1; 
    count++; 
  } 
 
  if (count) 
    v.eb(2, count);

  for (ll i = 3; i <= sqrt(n); i += 2) 
  { 
    count = 0; 
    while (n % i == 0) 
    { 
      count++; 
      n = n / i; 
    } 
    if (count) 
      v.eb(i, count);
  } 

  if (n > 2) 
    v.eb(n, 1);
  return v;
} 

void pre()
{
  // prepare_factorials();
}

ll fun(ll n)
{
  return (n * (n + 1)) / 2;
}

ll boop(ll n)
{
  dbg(n);
  ll l = 0;
  ll r = 1e7;
  ll ans = 0;
  while(l <= r)
  {
    ll mid = (l + r) / 2;
    dbg(mid);
    if(fun(mid) > n)
    {
      r = mid - 1;
    }
    else if(fun(mid) < n)
    {
      l = mid + 1;
      ans = max(ans, mid);
    }
    else
    {
      return mid;
    }
  }
  return ans;
}

void solve()
{
  ll n;
  cin >> n; 
  vpll v1 = fact(n);
  sort(all(v1));
  ll ans = 0;
  if(n == 1)
    cout << ans << "\n";
  else
  {
    for(auto p: v1)
    {
      ans += boop(p.ss);
    }
    cout << ans << "\n";
  }
}


signed main()
{  
    startTime = clock();

    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    #ifdef LOCAL
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
    #endif

    //cout << fixed << setprecision(15);
    pre();

    ll test = 1;
    // cin >> test;
    frb(_CASE_, 1, test)
    {
      // cout << "Case #" << _CASE_ << ": ";
      //dbg(_CASE_);
      solve();
    }

    dbg_time();
    
    return 0;
}     


Measured memory_bytes: 3688