




'''simple docstring'''





def 	UpperCamelCase_(      snake_case				:			Optional[Any]	):

							'''simple docstring'''






							snake_case_         = [1]

							snake_case_   , snake_case_   , snake_case_         = 0, 0, 0
							snake_case_         = ugly_nums[ia] * 2
							snake_case_         = ugly_nums[ia] * 3
							snake_case_         = ugly_nums[ia] * 5

							for _ in range(1				,							snake_case	):
														snake_case_         = min(snake_case				,							snake_case				,							snake_case	)
														ugly_nums.append(snake_case	)
														if next_num == next_a:
																					ia += 1
																					snake_case_         = ugly_nums[ia] * 2
														if next_num == next_a:
																					ia += 1
																					snake_case_         = ugly_nums[ia] * 3
														if next_num == next_a:
																					ia += 1
																					snake_case_         = ugly_nums[ia] * 5
							return ugly_nums[-1]


if __name__ == "__main__":
		from doctest import testmod

		testmod(verbose=True)
		print(F"{ugly_numbers(200) = }")










def lowercase    (  SCREAMING_SNAKE_CASE )			->							str:


			'''simple docstring'''







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


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