



'''simple docstring'''



def   __lowerCAmelCase					(							lowerCamelCase   :						int					):






	'''simple docstring'''




	__lowerCAmelCase												=  len(lowerCamelCase					)
	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(lowerCamelCase					)]
		# Reverse whole list
		__lowerCAmelCase												=  arr[cur - 1 :: -1] + arr[cur : len(lowerCamelCase					)]
		cur -= 1
	return arr


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




'''simple docstring'''



def   __lowerCAmelCase					(							lowerCamelCase   :						Union[str, Any]					):






	'''simple docstring'''




	__lowerCAmelCase												=  1
	__lowerCAmelCase												=  2
	while i * i <= n:
		__lowerCAmelCase												=  0
		while n % i == 0:
			n //= i
			multiplicity += 1
		n_divisors *= multiplicity + 1
		i += 1
	if n > 1:
		n_divisors *= 2
	return n_divisors



def   __lowerCAmelCase					(							):






	'''simple docstring'''




	__lowerCAmelCase												=  1
	__lowerCAmelCase												=  1

	while True:
		i += 1
		t_num += i

		if count_divisors(lowerCamelCase					) > 5_00:
			break

	return t_num


if __name__ == "__main__":
	print(solution())