






from itertools import count




def      lowercase__      (     __snake_case    :							int = 50  ):


					'''simple docstring'''


					UpperCAmelCase_    :      Optional[int]            =						[1] * min_block_length

					for n in count(__snake_case  ):
										fill_count_functions.append(1  )

										for block_length in range(__snake_case     ,       n + 1  ):
															for block_start in range(n - block_length  ):
																				fill_count_functions[n] += fill_count_functions[
																				    n - block_start - block_length - 1
																				]

															fill_count_functions[n] += 1

										if fill_count_functions[n] > 1_000_000:
															break

					return n


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














def      lowercase__      (     __snake_case    :							list  ):


					'''simple docstring'''


					for i in range(len(__snake_case  ) - 1     ,       0     ,       -1  ):
										UpperCAmelCase_    :      Dict            =						False

										for j in range(__snake_case     ,       0     ,       -1  ):
															if unsorted[j] < unsorted[j - 1]:
																				UpperCAmelCase_       ,  UpperCAmelCase_    :      Any            =						unsorted[j - 1], unsorted[j]
																				UpperCAmelCase_    :      int            =						True

										for j in range(__snake_case  ):
															if unsorted[j] > unsorted[j + 1]:
																				UpperCAmelCase_       ,  UpperCAmelCase_    :      Optional[int]            =						unsorted[j + 1], unsorted[j]
																				UpperCAmelCase_    :      Any            =						True

										if not swapped:
															break
					return unsorted


if __name__ == "__main__":
		import doctest

		doctest.testmod()
		__UpperCAmelCase								=						input('Enter numbers separated by a comma:\n').strip()
		__UpperCAmelCase								=						[int(item) for item in user_input.split(',')]
		print(F'{cocktail_shaker_sort(unsorted) = }')






