title: Split N Maximum Composite Numbers
signature: pub fn split_n_maximum_composite_numbers(n: i32) -> i32 {
test_code: use std::collections::HashMap;
  use std::collections::HashSet;
  use std::cmp::*;
  use std::collections::*;
  use std::fmt::*; 
  
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  pub fn validate_solution(actual: i32, expected: i32)->bool{
  return actual==expected
  }
  pub fn driver(n: i32, expected: i32)->String{
      if validate_solution(PLACEHOLDER_FN_NAME(n), expected) {
        return "PASSED".to_string();
      };
      return "FAILED".to_string();
  
  }
  
  fn main() {
      println!("TEST-0...{}", driver(
        55, 
        12
      ));
      
      println!("TEST-1...{}", driver(
        35, 
        7
      ));
      
      println!("TEST-2...{}", driver(
        24, 
        6
      ));
      
      println!("TEST-3...{}", driver(
        75, 
        17
      ));
      
      println!("TEST-4...{}", driver(
        5, 
        -1
      ));
      
      println!("TEST-5...{}", driver(
        7, 
        -1
      ));
      
      println!("TEST-6...{}", driver(
        50, 
        12
      ));
      
      println!("TEST-7...{}", driver(
        28, 
        7
      ));
      
      println!("TEST-8...{}", driver(
        67, 
        15
      ));
      
      println!("TEST-9...{}", driver(
        59, 
        13
      ));
      
  }
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;
    }
  }