#include<iostream>
#include <math.h>
using namespace std;
int main()
{
int n, nOriginal;
while(cin>>n && n!=0){
nOriginal = n;
int factorNum=0;
int upBound = sqrt((double)n)+1;
for(int prime=2;prime<=upBound;prime++){
if(n%prime==0){
factorNum++;
n/=prime;
while(n%prime==0){
n /= prime;
}
}
}
if(n!=1){
factorNum++;
}
cout<<nOriginal<<" : "<<factorNum<<endl;
}
return 0;
}