title: Split N Maximum Composite Numbers
signature: fun splitNMaximumCompositeNumbers(n: Int): Int {
test_code: package main
  
  import kotlin.text.*
  import kotlin.math.*
  
  
  // SOLUTION CODE
  // ===================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE
  // ===================================
  fun validateSolution(actual:Int, expected:Int):Boolean{
    return actual.equals(expected)
  }
  fun driver(n: Int, expected:Int):String {
      try{
        if (validateSolution(PLACEHOLDER_FN_NAME(n), expected)) {
                return "PASSED"
        }
        return "FAILED"
      } catch (e: Exception){
        return e::class.simpleName as String
      }
  
  }
  
  fun main() {
      var result: String = ""
      result = driver(55, 12)
      println("TEST-0...${result}")
      
      result = driver(35, 7)
      println("TEST-1...${result}")
      
      result = driver(24, 6)
      println("TEST-2...${result}")
      
      result = driver(75, 17)
      println("TEST-3...${result}")
      
      result = driver(5, -1)
      println("TEST-4...${result}")
      
      result = driver(7, -1)
      println("TEST-5...${result}")
      
      result = driver(50, 12)
      println("TEST-6...${result}")
      
      result = driver(28, 7)
      println("TEST-7...${result}")
      
      result = driver(67, 15)
      println("TEST-8...${result}")
      
      result = driver(59, 13)
      println("TEST-9...${result}")
      
          
  }
  
  main()
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;
    }
  }