title: Split N Maximum Composite Numbers
signature: split_n_maximum_composite_numbers <- function(n) {
test_code: 
  
  
  # SOLUTION CODE
  # ============================================
  PLACEHOLDER_CODE_BODY
  
  # TESTING CODE 
  # ============================================
  validate_solution <- function(actual, expected) {
      toString(actual)==toString(expected)
  }
  
  driver <- function(n, expected){
      if (validate_solution(PLACEHOLDER_FN_NAME(n), expected)){
          "PASSED"
      } else{
          "FAILED"
      }
  }
  
  main <- function() {
      cat(sprintf("TEST-0...%s\n",driver(
          55L, 
          12L
      )))
  
      cat(sprintf("TEST-1...%s\n",driver(
          35L, 
          7L
      )))
  
      cat(sprintf("TEST-2...%s\n",driver(
          24L, 
          6L
      )))
  
      cat(sprintf("TEST-3...%s\n",driver(
          75L, 
          17L
      )))
  
      cat(sprintf("TEST-4...%s\n",driver(
          5L, 
          -1L
      )))
  
      cat(sprintf("TEST-5...%s\n",driver(
          7L, 
          -1L
      )))
  
      cat(sprintf("TEST-6...%s\n",driver(
          50L, 
          12L
      )))
  
      cat(sprintf("TEST-7...%s\n",driver(
          28L, 
          7L
      )))
  
      cat(sprintf("TEST-8...%s\n",driver(
          67L, 
          15L
      )))
  
      cat(sprintf("TEST-9...%s\n",driver(
          59L, 
          13L
      )))
  
  }
  
  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;
    }
  }