macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut iter = $s.split_whitespace();
        let mut next = || { iter.next().unwrap() };
        input_inner!{next, $($r)*}
    };
    ($($r:tt)*) => {
        let stdin = std::io::stdin();
        let mut bytes = std::io::Read::bytes(std::io::BufReader::new(stdin.lock()));
        let mut next = move || -> String {
            bytes
                .by_ref()
                .map(|r| r.unwrap() as char)
                .skip_while(|c| c.is_whitespace())
                .take_while(|c| !c.is_whitespace())
                .collect()
        };
        input_inner!{next, $($r)*}
    };
}

macro_rules! input_inner {
    ($next:expr) => {};
    ($next:expr, ) => {};

    ($next:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($next, $t);
        input_inner!{$next $($r)*}
    };

    ($next:expr, mut $var:ident : $t:tt $($r:tt)*) => {
        let mut $var = read_value!($next, $t);
        input_inner!{$next $($r)*}
    };
}

macro_rules! read_value {
    ($next:expr, ( $($t:tt),* )) => {
        ( $(read_value!($next, $t)),* )
    };

    ($next:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()
    };

    ($next:expr, [ $t:tt ]) => {
        {
            let len = read_value!($next, usize);
            (0..len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()
        }
    };

    ($next:expr, chars) => {
        read_value!($next, String).chars().collect::<Vec<char>>()
    };

    ($next:expr, usize1) => {
        read_value!($next, usize) - 1
    };

    ($next:expr, $t:ty) => {
        $next().parse::<$t>().expect("Parse error")
    };
}

#[allow(unused_imports)]
use num::integer::{gcd, lcm};
#[allow(unused_imports)]
use permutohedron::LexicalPermutation;
#[allow(unused_imports)]
use std::cmp;
#[allow(unused_imports)]
use std::collections::{BinaryHeap, HashMap, HashSet};
#[allow(dead_code)]
const MOD: i32 = 1e9 as i32 + 7;

fn is_prime(n: usize) -> bool {
    match n {
        0 | 1 => false,
        n => (2..).take_while(|x| x * x <= n).all(|x| n % x != 0),
    }
}

fn prime_all(n: usize) -> Vec<usize> {
    let mut list = Vec::new();
    list.push(2);
    let mut i = 3;
    while i <= n {
        let mut j: usize = 3;
        let mut flg = false;
        while j < (i as f64).sqrt() as usize + 1 {
            if i % j == 0 {
                flg = true;
                break;
            }
            j += 2;
        }
        if !flg {
            list.push(i);
        }
        i += 2;
    }

    list
}
fn main() {
    input!(n: usize);
    if n == 1 {
        println!("0");
        return;
    }
    let list = prime_all((n as f32).sqrt() as usize + 1);
    let mut n = n;
    let mut ans = 0;
    for x in &list {
        let mut xx = *x;
        if *x > n {
            println!("{}",ans);
            return;
        }
        loop {
            if n % xx == 0 {
                n /= xx;
                xx *= x;
                ans += 1;
            }else{
                break;
            }
        }
    }
    /*
    if is_prime(n) {
        println!("{}", ans+1);
    }else{
        println!("{}",ans);
    }
    */
    println!("{}", ans+1);
}


Measured memory_bytes: 2744