title: Split N Maximum Composite Numbers
signature: int splitNMaximumCompositeNumbers(int n) {
test_code: #include <algorithm>
  #include <assert.h>
  #include <cstdlib>
  #include <iostream>
  #include <map>
  #include <set>
  #include <string>
  #include <tuple> 
  #include <unordered_map>
  #include <vector>
  #include <math.h>
  #include <cmath>
  #include <bits/stdc++.h>
  #include <numeric>
  #include <functional>
  
  using namespace std;
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  bool validateSolution(int actual, int expected){
      return actual == expected;
  }
  
  string driver(int n, int expected){
      try
      {
          if (validateSolution(PLACEHOLDER_FN_NAME(n), expected)){
              return "PASSED";
          }
          return "FAILED";
      }
      catch (const std::overflow_error& exception_obj)
      {
          return typeid(exception_obj).name();
      }
      catch (const std::runtime_error& exception_obj)
      {
          return typeid(exception_obj).name();
      }
      catch (const std::exception& exception_obj)
      {
          return typeid(exception_obj).name();
      }
      catch (...)
      {
          return "UNK_ERROR";
      }
  }
  
  int main() {
      string result = "";
  
      result = driver(55, 12); 
      cout << "TEST-" << 0 << "..."
           <<  result
           << "\n";
  
      result = driver(35, 7); 
      cout << "TEST-" << 1 << "..."
           <<  result
           << "\n";
  
      result = driver(24, 6); 
      cout << "TEST-" << 2 << "..."
           <<  result
           << "\n";
  
      result = driver(75, 17); 
      cout << "TEST-" << 3 << "..."
           <<  result
           << "\n";
  
      result = driver(5, -1); 
      cout << "TEST-" << 4 << "..."
           <<  result
           << "\n";
  
      result = driver(7, -1); 
      cout << "TEST-" << 5 << "..."
           <<  result
           << "\n";
  
      result = driver(50, 12); 
      cout << "TEST-" << 6 << "..."
           <<  result
           << "\n";
  
      result = driver(28, 7); 
      cout << "TEST-" << 7 << "..."
           <<  result
           << "\n";
  
      result = driver(67, 15); 
      cout << "TEST-" << 8 << "..."
           <<  result
           << "\n";
  
      result = driver(59, 13); 
      cout << "TEST-" << 9 << "..."
           <<  result
           << "\n";
  
      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;
    }
  }