






def       __lowerCAmelCase      (						__snake_case       ):

					if length <= 0 or not isinstance(__lowerCAmelCase					, __lowerCAmelCase       ):
										raise ValueError("Length must be a positive integer."       )
					return [n * (2 * n - 1) for n in range(__lowerCAmelCase       )]


if __name__ == "__main__":
	print(hexagonal_numbers(length=5))
	print(hexagonal_numbers(length=10))














def       __lowerCAmelCase      (						__snake_case       ):
     __lowerCAmelCase								=					len(__snake_case       )
     while cur > 1:
          # Find the maximum number in arr
          __lowerCAmelCase								=					arr.index(max(arr[0:cur]       )       )
          # Reverse from 0 to mi
          __lowerCAmelCase								=					arr[mi::-1] + arr[mi + 1 : len(__snake_case       )]
          # Reverse whole list
          __lowerCAmelCase								=					arr[cur - 1 :: -1] + arr[cur : len(__snake_case       )]
          cur -= 1
     return arr


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






