title: Hardy Ramanujan Theorem
signature: class Solution {
  
      public Integer hardyRamanujanTheorem(Integer n) {
test_code: import static java.util.Map.entry;  
  import java.util.*;
  import java.lang.*;
  // TESTING CODE 
  // ============================================
  class QuestionEvaluator {
      public static String validateSolution(Integer n, Integer expected){
          try{
              Driver driver = new Driver();
              if (driver.run(n,expected)){
                  return "PASSED";
              }
              return "FAILED";
              
          } catch (Exception exception_obj){
              return exception_obj.getClass().getSimpleName();
          }
  
      }
      public static void main(String[] args) {
          String result;
          result = validateSolution(99, 2);
          System.out.println(String.format("%s%s","TEST-0...",result));    
      
          result = validateSolution(33, 2);
          System.out.println(String.format("%s%s","TEST-1...",result));    
      
          result = validateSolution(50, 2);
          System.out.println(String.format("%s%s","TEST-2...",result));    
      
          result = validateSolution(17, 1);
          System.out.println(String.format("%s%s","TEST-3...",result));    
      
          result = validateSolution(18, 2);
          System.out.println(String.format("%s%s","TEST-4...",result));    
      
          result = validateSolution(69, 2);
          System.out.println(String.format("%s%s","TEST-5...",result));    
      
          result = validateSolution(23, 1);
          System.out.println(String.format("%s%s","TEST-6...",result));    
      
          result = validateSolution(18, 2);
          System.out.println(String.format("%s%s","TEST-7...",result));    
      
          result = validateSolution(94, 2);
          System.out.println(String.format("%s%s","TEST-8...",result));    
      
          result = validateSolution(16, 1);
          System.out.println(String.format("%s%s","TEST-9...",result));    
      
      }
  }
  
  class Driver{
      public boolean run(Integer n, Integer expected){
  
          PLACEHOLDER_CLS_NAME sol = new PLACEHOLDER_CLS_NAME();
          return validateSolution(sol.PLACEHOLDER_FN_NAME(n),expected);
      }
      
      public boolean validateSolution(Integer actual, Integer expected){
          return actual.equals(expected);
      }
  }
  
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
source_py: def hardy_ramanujan_theorem(n):
      count = 0
      if ((n % 2) == 0):
          count = (count + 1)
          while ((n % 2) == 0):
              n = int((n / 2))
      i = 3
      while (i <= int(math.sqrt(n))):
          if ((n % i) == 0):
              count = (count + 1)
              while ((n % i) == 0):
                  n = int((n / i))
          i = (i + 2)
      if (n > 2):
          count = (count + 1)
      return count
source_cpp: int hardy_ramanujan_theorem(int n) {
    int count = 0;
    if ( n % 2 == 0 ) {
      count ++;
      while ( n % 2 == 0 ) n = n / 2;
    }
    for ( int i = 3;
    i <= sqrt ( n );
    i = i + 2 ) {
      if ( n % i == 0 ) {
        count ++;
        while ( n % i == 0 ) n = n / i;
      }
    }
    if ( n > 2 ) count ++;
    return count;
  }