ACM UVA-10699

prime

int main(int argc, char const* argv[])
{
    int n;
    while(~scanf("%d",&n) && n != 0){
        int nn = sqrt(n);
        int count = 0;
        int k = n;
        for(int i = 2;i<= nn;i++){
            if(n%i == 0){
                while(n%i == 0) {
                    n = n/i;
                }
                count++;
            }
        }
        if(n>1){
            count++;
        }
        n = k;
        printf("%d : %d\n",n,count);
    }

    return 0;
}