#include <stdio.h>
#include <conio.h>
 
int IsPrime( int );
int FindNextPrime( int );
 
int main()
{
	int num,divisor = 2;
	printf("Enter number:");
	scanf("%d",&num );
	printf("The prime factors are:\n");
 
	while( !IsPrime(num))
	{
		while(1)
		{
			if( num%divisor == 0 )
			{
				printf("%d\n",divisor );
				num/=divisor;
				break;
			}
			divisor = FindNextPrime( divisor );
		}
	}
	printf("%d",num);
 
	getch();
	return 0;
}
	//------ End of main() ------
 
int IsPrime( int num )		// Checks whether a number is prime
{
	int i;
	for( i=2; i<=num/2; i++ )
	{
		if( num%i == 0 )
			return 0;
	}
	return 1;
}
 
int FindNextPrime( int num ) // Returns next prime number from passed arg.
{
	do
	{
		if( num == 2 )
			num++;
		else
			num+=2;
	} while( !IsPrime(num));
	return num;
}