function main( args ) {
  let N = BigInt(args);
  if ( N < 2n ) return console.log('0');
  let count = 0, pmax = 1n;
  const pn = [];
  OUTER: for ( let p = 2n; p*pmax < N || p === N; p++ ) {
    for ( let i = 0, j; j = pn[i], j*j <= p; i++ ) {
      if ( p % j === 0n ) continue OUTER;
    }
    pn.push(pmax=p);
    for ( let z = p; z <= N; z*=p ) {
      if ( N % z === 0n ) {
        count++;
        N /= z;
      } else {
        while ( !(N%p) ) { N/=p; }
        break;
      }
    }
  }
  if ( count === 0 ) count = 1;
  console.log(count.toString());
}
main(require("fs").readFileSync("/dev/stdin", "utf8"));