title: Split N Maximum Composite Numbers
signature: splitNMaximumCompositeNumbers(n) {
test_code: import 'dart:convert';
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  bool validateSolution(int actual, int expected){
      return actual.toString() == expected.toString();
  }
  
  String driver(n, int expected){
      try
      {
          if (validateSolution(PLACEHOLDER_FN_NAME(n), expected)){
              return "PASSED";
          }
          return "FAILED";
      }catch(exception_object){
          return exception_object.runtimeType.toString();
      }
  }
  
  int main() {
  
      print("TEST-0...${driver(
          55, 
          12)
      }");
  
      print("TEST-1...${driver(
          35, 
          7)
      }");
  
      print("TEST-2...${driver(
          24, 
          6)
      }");
  
      print("TEST-3...${driver(
          75, 
          17)
      }");
  
      print("TEST-4...${driver(
          5, 
          -1)
      }");
  
      print("TEST-5...${driver(
          7, 
          -1)
      }");
  
      print("TEST-6...${driver(
          50, 
          12)
      }");
  
      print("TEST-7...${driver(
          28, 
          7)
      }");
  
      print("TEST-8...${driver(
          67, 
          15)
      }");
  
      print("TEST-9...${driver(
          59, 
          13)
      }");
  
      return 0;
  }
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;
    }
  }