input: Write a function that recursively separates a number into three sections and calculates their maximum possible total sum for the given input.
  assert breakSum(12) == 13
  assert breakSum(24) == 27
  assert breakSum(23) == 23
output: 
  def breakSum(n):
      if n < 12:
          return n
      return max(n, breakSum(n // 2) + breakSum(n // 3) + breakSum(n // 4))
  