#include<fstream>
using namespace std;

bool isPrime(int num);

int howManyNonPrimeFactors(int num);

int main (){
ofstream fout("OUT2.txt");
ifstream fin("DATA2.txt");

int number;

for (short i(0);i<5;i++){
	fin>>number;
	if (isPrime(number)){ fout<<"0"<<endl;continue;}
	fout<<howManyNonPrimeFactors(number)<<endl;continue;
}



return 0;
}


bool isPrime(int num){
			int count=0;
			for (int i=1;i<=num;i++){
				if (num%i==0)count++;
				if (count>2)break;
				
				} 		
			if (count>2)return false;
			else return true;
		}

int howManyNonPrimeFactors(int num){
	int count(0); int factor(num);

	while(factor != 1){
		if (factor%2 ==0) { factor/=2;  count++;continue;}
		if (factor%3 ==0) { factor/=3;  count++;continue;}
		if (factor%5 ==0) { factor/=5;  count++;continue;}
		if (factor%7 ==0) { factor/=7;  count++;continue;}
		if (factor%11 ==0){ factor/=11; count++;continue;}
		if (factor%13 ==0){ factor/=13; count++;continue;}
		if (factor%17 ==0){ factor/=17; count++;continue;}
		if (factor%19 ==0){ factor/=19; count++;continue;}
		if (factor%23 ==0){ factor/=23; count++;continue;}
		if (factor%29 ==0){ factor/=29; count++;continue;}
		if (factor%31 ==0){ factor/=31; count++;continue;}
	}

return count;}