"use strict";
    
function prime(n) {
  //n未満の素数を配列で返す。
  var ps, x, flg, j;
  ps = [2, 3];
  for(x = 5; x < n; x += 2) {
    flg = 0;
    for(j = 0; ps[j] * ps[j] <= x; j++) {
      if(x % ps[j] == 0) {
        flg = 1;
        break;
      }
    }
    if(flg == 0) {
      ps.push(x);
    }
  }
  return ps;
}

const main = arg => {
    arg = arg.trim().split("\n");
    let N = parseInt(arg[0].split(" ")[0]);
    
    // 1000000までの素数全列挙、zになるうる数全列挙
    // console.log(prime(1000000).length)
    
    const primes = prime(1000000);
    const pL = primes.length;
    
    let zs = [];
    
    for(let i=0; i<pL; i++) {
        let prime = primes[i];
        zs.push(prime);
        
        while(true) {
            prime *= primes[i];
            
            if(prime > 100000) break;
            zs.push(prime);
        }
    }
    
    let set = [...new Set(zs)].sort((a,b)=>a-b);
    let used = {};
    const sN = set.length;
    let cnt = 0;
    let debug = 0;
    
    //console.log(set)
    
	for(let i=0; i<sN; i++) {
            // まだ使っていないかつ、割り切れる
            
            if(!used[set[i]] && N % set[i] === 0) {
                N /= set[i];
                cnt++;
            }
            
            used[i] = true;
            
            if(set[i] > N) {
                console.log(cnt);
                return;
            } 
        }
    
  console.log(1)
}
main(require('fs').readFileSync('/dev/stdin', 'utf8'));