title: Split N Maximum Composite Numbers
signature: def splitNMaximumCompositeNumbers(n: 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(n: Int, expected: Int): String = {
      try {
          if (validateSolution(PLACEHOLDER_FN_NAME(n),expected)) {
              "PASSED"
          } else{
              "FAILED"
          }
      }catch{
          case e: Exception => {e.getClass.getName}
      }
  
  }
  object QuestionEvaluator extends App {
  
      println(s"TEST-0...${driver(
        55, 
        12    
      )}")   
  
  
      println(s"TEST-1...${driver(
        35, 
        7    
      )}")   
  
  
      println(s"TEST-2...${driver(
        24, 
        6    
      )}")   
  
  
      println(s"TEST-3...${driver(
        75, 
        17    
      )}")   
  
  
      println(s"TEST-4...${driver(
        5, 
        -1    
      )}")   
  
  
      println(s"TEST-5...${driver(
        7, 
        -1    
      )}")   
  
  
      println(s"TEST-6...${driver(
        50, 
        12    
      )}")   
  
  
      println(s"TEST-7...${driver(
        28, 
        7    
      )}")   
  
  
      println(s"TEST-8...${driver(
        67, 
        15    
      )}")   
  
  
      println(s"TEST-9...${driver(
        59, 
        13    
      )}")   
  
  }
  
source_py: def split_n_maximum_composite_numbers(n):
      if (n < 4):
          return (- 1)
      rem = (n % 4)
      if (rem == 0):
          return (n // 4)
      if (rem == 1):
          if (n < 9):
              return (- 1)
          return (((n - 9) // 4) + 1)
      if (rem == 2):
          return (((n - 6) // 4) + 1)
      if (rem == 3):
          if (n < 15):
              return (- 1)
          return (((n - 15) // 4) + 2)
source_cpp: int split_n_maximum_composite_numbers(int n) {
    if ( n < 4 ) return - 1;
    int rem = n % 4;
    if ( rem == 0 ) return n / 4;
    if ( rem == 1 ) {
      if ( n < 9 ) return - 1;
      return ( n - 9 ) / 4 + 1;
    }
    if ( rem == 2 ) return ( n - 6 ) / 4 + 1;
    if ( rem == 3 ) {
      if ( n < 15 ) return - 1;
      return ( n - 15 ) / 4 + 2;
    }
  }