#include<stdio.h>
int couprime(int n) {
	int count = 0;
	int i = 2;
	while(i<=n) {
		if (n % i == 0&& isprime(i)) {
			count++;
			n /= i;		
		}
		else
			i++;
	}
	return count;
}
int isprime(int n) {
	for (int i = 2; i < n; i++) {
		if (n % 2 == 0)
			return 0;
	}
	return 1;
}
int main() {
	int n,k;
	scanf("%d", &n);
	printf("%d",couprime(n));
	
}

可能是数据过大导致循环次数多而超时