


def 			_a      (    __UpperCamelCase			):
     if len(__UpperCamelCase			) > 1:
          a_     :  Optional[int]				      =     len(__UpperCamelCase			) // 2  # Finds the middle of the array
          a_     :  str				      =     arr[
              :middle_length
          ]  # Creates an array of the elements in the first half.
          a_     :  Any				      =     arr[
              middle_length:
          ]  # Creates an array of the elements in the second half.
          a_     :  Dict				      =     len(__UpperCamelCase			)
          a_     :  List[Any]				      =     len(__UpperCamelCase			)
          merge(__UpperCamelCase			)  # Starts sorting the left.
          merge(__UpperCamelCase			)  # Starts sorting the right
          a_     :  str				      =     0  # Left Counter
          a_     :  Union[str, Any]				      =     0  # Right Counter
          a_     :  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]:
                    a_     :  Any				      =     left_array[left_index]
                    left_index += 1
               else:
                    a_     :  List[str]				      =     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
               a_     :  List[Any]				      =     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
               a_     :  Dict				      =     right_array[right_index]
               right_index += 1
               index += 1
     return arr


if __name__ == "__main__":
       import doctest

       doctest.testmod()










def        A__						(							SCREAMING_SNAKE_CASE_ = 1_0_0_0		) ->  int:
		lowerCamelCase :			Dict    		=[]
		lowerCamelCase :			Dict    		=[]
		lowerCamelCase :			Union[str, Any]    		=3
		lowerCamelCase :			List[str]    		=5
		lowerCamelCase :			Union[str, Any]    		=1
		while True:
				lowerCamelCase :			Dict    		=z * temp
				if result < n:
						zmulti.append(SCREAMING_SNAKE_CASE_		)
						temp += 1
				else:
						lowerCamelCase :			List[Any]    		=1
						break
		while True:
				lowerCamelCase :			Optional[Any]    		=x * temp
				if result < n:
						xmulti.append(SCREAMING_SNAKE_CASE_		)
						temp += 1
				else:
						break
		lowerCamelCase :			str    		=list(set(xmulti + zmulti		)		)
		return sum(SCREAMING_SNAKE_CASE_		)


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

