title: Maximum Value Choice Either Dividing Considering
signature: function maximumValueChoiceEitherDividingConsidering(n) {
test_code: 
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  function convertToString(value) {
      return JSON.stringify(value, function (key, val) {
          if (val instanceof Set) {
              return Array.from(val);
          } return val;});
  }
  
  function validateSolution(actual, expected){
      return convertToString(actual)===convertToString(expected);
  }
  
  function driver(n, expected){
      try{
          if (validateSolution(PLACEHOLDER_FN_NAME(n),expected)){
              return "PASSED";
          }
          return "FAILED";
      } catch (error) {
        return error.name;
      }
      
  }
      
  function main(){
    let result = '';
    result = driver(3, 3);
    console.log(`TEST-0...${result}`);
  
    result = driver(19, 24);
    console.log(`TEST-1...${result}`);
  
    result = driver(39, 57);
    console.log(`TEST-2...${result}`);
  
    result = driver(89, 152);
    console.log(`TEST-3...${result}`);
  
    result = driver(96, 192);
    console.log(`TEST-4...${result}`);
  
    result = driver(68, 114);
    console.log(`TEST-5...${result}`);
  
    result = driver(48, 83);
    console.log(`TEST-6...${result}`);
  
    result = driver(5, 5);
    console.log(`TEST-7...${result}`);
  
    result = driver(3, 3);
    console.log(`TEST-8...${result}`);
  
    result = driver(4, 4);
    console.log(`TEST-9...${result}`);
  
    process.exit(0);
  };
  
  if (require.main === module) {
    main();
  }
source_py: def maximum_value_choice_either_dividing_considering(n):
      res = list()
      res.append(0)
      res.append(1)
      i = 2
      while (i < (n + 1)):
          res.append(max(i, (((res[int((i / 2))] + res[int((i / 3))]) + res[int((i / 4))]) + res[int((i / 5))])))
          i = (i + 1)
      return res[n]
source_cpp: int maximum_value_choice_either_dividing_considering(int n) {
    int res [ n + 1 ];
    res [ 0 ] = 0;
    res [ 1 ] = 1;
    for ( int i = 2;
    i <= n;
    i ++ ) res [ i ] = max ( i, ( res [ i / 2 ] + res [ i / 3 ] + res [ i / 4 ] + res [ i / 5 ] ) );
    return res [ n ];
  }