def 				UpperCAmelCase						(    lowercase							):







				"""simple docstring"""



				if len(snake_case__							) < 2:
								return collection

				def circle_sort_util(lowercase							,			lowercase							,			lowercase							) -> bool:
								__lowercase 			=							False

								if low == high:
												return swapped

								__lowercase 			=							low
								__lowercase 			=							high

								while left < right:
												if collection[left] > collection[right]:
																__lowercase			,     __lowercase 			=							(
																    collection[right],
																    collection[left],
																)
																__lowercase 			=							True

												left += 1
												right -= 1

								if left == right and collection[left] > collection[right + 1]:
												__lowercase			,     __lowercase 			=							(
												    collection[right + 1],
												    collection[left],
												)

												__lowercase 			=							True

								__lowercase 			=							low + int((high - low) / 2							)
								__lowercase 			=							circle_sort_util(snake_case__							,			snake_case__							,			snake_case__							)
								__lowercase 			=							circle_sort_util(snake_case__							,			mid + 1							,			snake_case__							)

								return swapped or left_swap or right_swap

				__lowercase 			=							True

				while is_not_sorted is True:
								__lowercase 			=							circle_sort_util(snake_case__							,			0							,			len(snake_case__							) - 1							)

				return collection


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





"""simple docstring"""




def     a__ (				snake_case__				)						->					bool:
			lowerCamelCase			      =					(1 + 24 * n) ** 0.5
			return ((1 + root) / 6) % 1 == 0



def     a__ (				snake_case__ = 50_00				)						->					int:
			lowerCamelCase			      =					[(i * (3 * i - 1)) // 2 for i in range(1       , snake_case__				)]
			for i, pentagonal_i in enumerate(snake_case__				):
						for j in range(snake_case__       , len(snake_case__				)				):
									lowerCamelCase			      =					pentagonal_nums[j]
									lowerCamelCase			      =					pentagonal_i + pentagonal_j
									lowerCamelCase			      =					pentagonal_j - pentagonal_i
									if is_pentagonal(snake_case__				) and is_pentagonal(snake_case__				):
												return b

			return -1


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



