title: Split N Maximum Composite Numbers
signature: function splitNMaximumCompositeNumbers($n) {
test_code: <?php
  
  
  // SOLUTION CODE 
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  function validateSolution($actual, $expected){
      return serialize($actual) == serialize($expected);
  }
  
  function driver($n, $expected){
      try{
        if (validateSolution(PLACEHOLDER_FN_NAME($n), $expected)){
          return "PASSED";
        }
        return "FAILED";
      }
      catch (Exception $exception_obj) {
        return get_class($exception_obj);
      }
  }
  
  function main(){
      printf("TEST-0...%s\n",driver(
        55, 
        12));
      
      printf("TEST-1...%s\n",driver(
        35, 
        7));
      
      printf("TEST-2...%s\n",driver(
        24, 
        6));
      
      printf("TEST-3...%s\n",driver(
        75, 
        17));
      
      printf("TEST-4...%s\n",driver(
        5, 
        -1));
      
      printf("TEST-5...%s\n",driver(
        7, 
        -1));
      
      printf("TEST-6...%s\n",driver(
        50, 
        12));
      
      printf("TEST-7...%s\n",driver(
        28, 
        7));
      
      printf("TEST-8...%s\n",driver(
        67, 
        15));
      
      printf("TEST-9...%s\n",driver(
        59, 
        13));
      
  }
  
  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;
    }
  }