title: Find First Natural Number Whose Factorial Divisible X
signature: def findFirstNaturalNumberWhoseFactorialDivisibleX(x: Int) = {
test_code: import scala.collection.mutable.HashMap
  import scala.collection.immutable.HashSet
  
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  
  // TESTING CODE 
  // ============================================
  def validateSolution(actual: Int , expected: Int): Boolean = {
      actual.toString == expected.toString
  }
  
  def driver(x: Int, expected: Int): String = {
      try {
          if (validateSolution(PLACEHOLDER_FN_NAME(x),expected)) {
              "PASSED"
          } else{
              "FAILED"
          }
      }catch{
          case e: Exception => {e.getClass.getName}
      }
  
  }
  object QuestionEvaluator extends App {
  
      println(s"TEST-0...${driver(
        67, 
        66    
      )}")   
  
  
      println(s"TEST-1...${driver(
        47, 
        46    
      )}")   
  
  
      println(s"TEST-2...${driver(
        57, 
        19    
      )}")   
  
  
      println(s"TEST-3...${driver(
        89, 
        88    
      )}")   
  
  
      println(s"TEST-4...${driver(
        67, 
        66    
      )}")   
  
  
      println(s"TEST-5...${driver(
        40, 
        5    
      )}")   
  
  
      println(s"TEST-6...${driver(
        16, 
        6    
      )}")   
  
  
      println(s"TEST-7...${driver(
        83, 
        82    
      )}")   
  
  
      println(s"TEST-8...${driver(
        93, 
        31    
      )}")   
  
  
      println(s"TEST-9...${driver(
        43, 
        42    
      )}")   
  
  }
  
source_py: def find_first_natural_number_whose_factorial_divisible_x(x):
      i = 1
      fact = 1
      for i in range(1, x):
          fact = (fact * i)
          if ((fact % x) == 0):
              break
      return i
source_cpp: int find_first_natural_number_whose_factorial_divisible_x(int x) {
    int i = 1;
    int fact = 1;
    for ( i = 1;
    i < x;
    i ++ ) {
      fact = fact * i;
      if ( fact % x == 0 ) break;
    }
    return i;
  }