

from __future__ import annotations






def        snake_case__		(    lowerCamelCase_     ,				lowerCamelCase_     ,				lowerCamelCase_     ,				lowerCamelCase_		):
							A      :					List[str]      		=					[]
							A		,		A      :					Optional[Any]      		=					input_list[low:mid], input_list[mid : high + 1]
							while left and right:
														result.append((left if left[0] <= right[0] else right).pop(0		)		)
							A      :					str      		=					result + left + right
							return input_list






def        snake_case__		(    lowerCamelCase_		):
							if len(lowerCamelCase_		) <= 1:
														return input_list
							A      :					Any      		=					list(lowerCamelCase_		)

							# iteration for two-way merging
							A      :					Any      		=					2
							while p <= len(lowerCamelCase_		):
														# getting low, high and middle value for merge-sort of single list
														for i in range(0     ,				len(lowerCamelCase_		)     ,				lowerCamelCase_		):
																					A      :					Dict      		=					i
																					A      :					Union[str, Any]      		=					i + p - 1
																					A      :					Optional[int]      		=					(low + high + 1) // 2
																					A      :					Optional[Any]      		=					merge(lowerCamelCase_     ,				lowerCamelCase_     ,				lowerCamelCase_     ,				lowerCamelCase_		)
														# final merge of last two parts
														if p * 2 >= len(lowerCamelCase_		):
																					A      :					Optional[int]      		=					i
																					A      :					List[Any]      		=					merge(lowerCamelCase_     ,				0     ,				lowerCamelCase_     ,				len(lowerCamelCase_		) - 1		)
																					break
														p *= 2

							return input_list


if __name__ == "__main__":
		lowercase			:				Union[str, Any]   =     input("Enter numbers separated by a comma:\n").strip()
		if user_input == "":
				lowercase			:				List[Any]   =     []
		else:
				lowercase			:				str   =     [int(item.strip()) for item in user_input.split(",")]
		print(iter_merge_sort(unsorted))









def        snake_case__		(    lowerCamelCase_ = 1000		):
							return sum(e for e in range(3     ,				lowerCamelCase_		) if e % 3 == 0 or e % 5 == 0		)


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






