/**
 *    author:  math2do
 *    created: 31.05.2020 17:52:49
**/

#include <bits/stdc++.h>

using namespace std;

template <typename A, typename B>
string to_string(pair<A, B> p);
 
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
 
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
 
string to_string(const string& s) {
  return '"' + s + '"';
}
 
string to_string(const char* s) {
  return to_string((string) s);
}
 
string to_string(bool b) {
  return (b ? "true" : "false");
}

string to_string(const char &ch) {
  return "'" + string(1, ch) + "'";
}

string to_string(vector<bool> v) {
  bool first = true;
  string res = "{";
  for (int i = 0; i < static_cast<int>(v.size()); i++) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(v[i]);
  }
  res += "}";
  return res;
}
 
template <size_t N>
string to_string(bitset<N> v) {
  string res = "";
  for (size_t i = 0; i < N; i++) {
    res += static_cast<char>('0' + v[i]);
  }
  reverse(res.begin(), res.end());
  return res;
}

template <typename A>
string to_string(A v) {
  bool first = true;
  string res = "{";
  for (const auto &x : v) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(x);
  }
  res += "}";
  return res;
}
 
template <typename A, typename B>
string to_string(pair<A, B> p) {
  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
 
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ")";
}
 
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}

void debug_out() { cerr << endl; }
 
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cerr << " " << to_string(H);
  debug_out(T...);
}
 
#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

namespace factoriser {
  vector<int> least = {0, 1};
  vector<int> primes;
  int precalculated = 1;
   
  void LinearSieve(int n) {
    n = max(n, 1);
    least.assign(n + 1, 0);
    primes.clear();
    for (int i = 2; i <= n; i++) {
      if (least[i] == 0) {
        least[i] = i;
        primes.push_back(i);
      }
      for (int x : primes) {
        if (x > least[i] || i * x > n) {
          break;
        }
        least[i * x] = x;
      }
    }
    precalculated = n;
  }
   
  void sieve(int n) {
    LinearSieve(n);
  }

  // prime factors 
  template <typename T>
  vector<pair<T, int>> prime_factorise(T x) {
    vector<pair<T, int>> fac;
    for (T i : primes) {
      T t = x / i;
      if (i > t) {
        break;
      }
      if (x == t * i) {
        int cnt = 0;
        while (x % i == 0) {
          x /= i;
          cnt++;
        }
        fac.emplace_back(i, cnt);
      }
    }
    if (x > 1) {
      fac.emplace_back(x, 1);
    }
    return fac;
  }
}

using namespace factoriser;

const int N = (int) 1e6;

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  sieve(N + 1);
  long long a;
  cin >> a;
  vector <pair <long long, int> > ret = prime_factorise(a);
  int ans = 0;
  for (auto &p : ret) {
    int fre = p.second;
    int n = 1;
    int which = -1;
    while (true) {
      if (n * (n + 1) / 2 > fre) {
        break;
      } 
      which = n;
      n++;
    } 
    ans += which;
  } 
  cout << ans << endl;
  return 0;
}


Measured memory_bytes: 7736