function solve(input) {
  let n = parseInt(input);
  if (n < 2) {
    return 0;
  }
  let count = 0;
  for (let p = 2; p * p <= n; p++) {
    if (n % p === 0) {
      let z = p;
      while (n % z === 0) {
        n /= z;
        z *= p;
        count++;
      }
      while (n % p === 0) {
        n /= p;
      }
    }
  }
  if (n > 1) {
    count++;
  }
  return count;
}

function main(input) {
  console.log(solve(input));
}

main(require('fs').readFileSync('/dev/stdin', 'utf8'));
