/*  Lab  3 
    
     Find prime factorization of a given number
*/

public class Prime_Factorization{
 
  // returns the largest whole number <= square root of a given whole number n.
 // Examples: sqroot(24) = 4, sqroot(36) =6.
 // It is already defined for you using java's built in function "sqrt" in 
 // "Math" class.
  public static int sqroot(int n){
    return((int)Math.sqrt(n));
  }     

  //Checks primality of n by dividing n at most upto sqroot(n)
  public static boolean pr(int n){
     
     /* write the body of this method */
  
   }


   //prints factorization of n
    public static void factors(int n){
       System.out.println("prime factorization of "+n+" is:");
     
    /* write rest of the body of this method */       

   }


  public static void main(String[]  args){
     factors(Integer.parseInt(args[0])); 
  }
}