#include<bits/stdc++.h>
#define F(l,r,i) for(int i=l;i<=r;i++)
#define ll long long
using namespace std;
ll N,ans,tmp,cnt,p;
int main(){
	cin>>N,p=sqrt(N);
	for(ll i=2;i<=p;i++){
		if(N%i==0){
			cnt=0,tmp=1;
			while(N%i==0) N/=i,cnt++;
			while((tmp+tmp*tmp)/2<=cnt) tmp++,ans++;
			//cout<<i<<' '<<cnt<<' '<<tmp<<' '<<N<<endl;
			
		} 
	}
	cout<<ans;
	return 0;
}
/*

(n+n^2)<cnt

*/
/*
N=p1^b1*p2^b2...pn^bn

*/