import java.util.Scanner;
class Assignment6G
{
	
	
		public static  void main ( String[]   args)			
		{
	                Scanner input = new Scanner (System.in);			
		      int  number,  k , done,choice,n,Originalnumber;
		      System.out.println("Type in a number");	
		      Originalnumber=input.nextInt();
		      
		      for (n=2; n<=Originalnumber; n++)
		         { 
				      k=2;   // start with the first prime number
				      done=0;
				     number=n;
		
					while(k<number/2 && done==0)  // continue until the numbers are too big 
			 		{
			   			if ((number % k) ==0)   // if the number is divisible by the prime number
			               		{                                         //the number is not prime
			   	       			done=1;
				   		}
				   		else
			  			  k++;                         // move on to the next number
			 		}
		
					if ((done) ==0)
					{
						if (Originalnumber%n==0)
							System.out.println("The number "+Originalnumber+" is divisible by"+ n);
						
					
					}
					//else
					//{ System.out.println("The number "+number+" is not prime.");	}
			         
				
			}
		     // System.out.println("Would you like to continue ? (0-no/1-yes) ");
		        //choice = input.nextInt();
		}
} 