



'''simple docstring'''



def       UpperCAmelCase__ (     UpperCAmelCase_   :    list[int]							)					->		list[int]:

     if len(__lowercase							) > 1:
          __lowerCamelCase       :     Optional[int]        =		len(__lowercase							) // 2  # Finds the middle of the array
          __lowerCamelCase       :     Optional[int]        =		arr[
              :middle_length
          ]  # Creates an array of the elements in the first half.
          __lowerCamelCase       :     str        =		arr[
              middle_length:
          ]  # Creates an array of the elements in the second half.
          __lowerCamelCase       :     Any        =		len(__lowercase							)
          __lowerCamelCase       :     int        =		len(__lowercase							)
          merge(__lowercase							)  # Starts sorting the left.
          merge(__lowercase							)  # Starts sorting the right
          __lowerCamelCase       :     List[str]        =		0  # Left Counter
          __lowerCamelCase       :     Any        =		0  # Right Counter
          __lowerCamelCase       :     Union[str, Any]        =		0  # Position Counter
          while (
              left_index < left_size and right_index < right_size
          ):  # Runs until the lowers size of the left and right are sorted.
               if left_array[left_index] < right_array[right_index]:
                    __lowerCamelCase       :     int        =		left_array[left_index]
                    left_index += 1
               else:
                    __lowerCamelCase       :     List[Any]        =		right_array[right_index]
                    right_index += 1
               index += 1
          while (
              left_index < left_size
          ):  # Adds the left over elements in the left half of the array
               __lowerCamelCase       :     Optional[int]        =		left_array[left_index]
               left_index += 1
               index += 1
          while (
              right_index < right_size
          ):  # Adds the left over elements in the right half of the array
               __lowerCamelCase       :     str        =		right_array[right_index]
               right_index += 1
               index += 1
     return arr


if __name__ == "__main__":
      import doctest

      doctest.testmod()










'''simple docstring'''



def       UpperCAmelCase__ (     UpperCAmelCase_   :    int = 4_00_00_00							)					->		int:
     __lowerCamelCase       :     int        =		1
     __lowerCamelCase       :     Union[str, Any]        =		2
     __lowerCamelCase       :     Optional[int]        =		0
     while j <= n:
          if j % 2 == 0:
               total += j
          __lowerCamelCase    ,	__lowerCamelCase       :     List[Any]        =		j, i + j

     return total


if __name__ == "__main__":
      print(f'''{solution() = }''')






