title: Split N Maximum Composite Numbers
signature: function split_n_maximum_composite_numbers(n)
test_code: using Printf
  
  # SOLUTION CODE
  # ============================================
  PLACEHOLDER_CODE_BODY
  
  # TESTING CODE 
  # ============================================
  function validate_solution(actual, expected)
      return actual == expected
  end
  
  function driver(n, expected)
      try
  
          if validate_solution(PLACEHOLDER_FN_NAME(n), expected)
              return "PASSED";
          end
          return "FAILED";
      catch exception_obj
          return string(Base.typename(typeof(exception_obj)).wrapper);
      end
  end
  
  function main()
      
      result = driver(55, 12);
      @printf("TEST-0...%s\n",result);
      
      result = driver(35, 7);
      @printf("TEST-1...%s\n",result);
      
      result = driver(24, 6);
      @printf("TEST-2...%s\n",result);
      
      result = driver(75, 17);
      @printf("TEST-3...%s\n",result);
      
      result = driver(5, -1);
      @printf("TEST-4...%s\n",result);
      
      result = driver(7, -1);
      @printf("TEST-5...%s\n",result);
      
      result = driver(50, 12);
      @printf("TEST-6...%s\n",result);
      
      result = driver(28, 7);
      @printf("TEST-7...%s\n",result);
      
      result = driver(67, 15);
      @printf("TEST-8...%s\n",result);
      
      result = driver(59, 13);
      @printf("TEST-9...%s\n",result);
      
  end
  
  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;
    }
  }