#include <stdio.h>
#include "mbed.h"

int IsPrimeNo(int n)
{
	int k;
	if(n == 1)
	 return 1;
	if(n == 2)
	 return 1;

	for(k = 2; k < n; k++)
	{
		if(n%k == 0)
			return 0;
	}
	return 1;
}

int primefactor(int n)
{
	int k;
	int count = 0;
	for(k = 1; k < n; k++)
	{
		if(n%k == 0)
		if(IsPrimeNo(k))
		{
			count++;
		}

	}

	return count+1;
}


int main()
{
	int prime;
	int result;
	while(1)
	{
		printf("please insert a number :");
		scanf("%d",&prime);
		printf("%d\n",prime);

		if(prime < 1)
			printf("this is not natural number\n");

		result = primefactor(prime);

		printf("The number of prime NO is : %d\n",result);


	}
	return 0;
}