






"""simple docstring"""




_snake_case        =  tuple[float, float, float]
_snake_case        =  tuple[float, float, float]

def      lowerCAmelCase__	(	UpperCamelCase__	,  UpperCamelCase__							):



  '''simple docstring'''
  _a    :			int			 =      end_pointa[0] - end_pointa[0]
  _a    :			int			 =      end_pointa[1] - end_pointa[1]
  _a    :			Union[str, Any]			 =      end_pointa[2] - end_pointa[2]
  return (x, y, z)

def      lowerCAmelCase__	(	UpperCamelCase__	,  UpperCamelCase__							):



  '''simple docstring'''
  _a    :			Dict			 =      ab[1] * ac[2] - ab[2] * ac[1]  # *i
  _a    :			str			 =      (ab[0] * ac[2] - ab[2] * ac[0]) * -1  # *j
  _a    :			List[str]			 =      ab[0] * ac[1] - ab[1] * ac[0]  # *k
  return (x, y, z)

def      lowerCAmelCase__	(	UpperCamelCase__	,  UpperCamelCase__							):



  '''simple docstring'''
  return tuple(round(__a	,  __a							) for x in vector							) == (0, 0, 0)



def      lowerCAmelCase__	(	UpperCamelCase__	,  UpperCamelCase__	,  UpperCamelCase__	,  UpperCamelCase__ = 1_0							):



  '''simple docstring'''
  _a    :			Union[str, Any]			 =      create_vector(__a	,  __a							)
  _a    :			str			 =      create_vector(__a	,  __a							)
  return is_zero_vector(get_ad_vectors_cross(__a	,  __a							)	,  __a							)








def   __lowerCamelCase   (				__a  :Optional[Any]       )						->							Tuple:






		"""simple docstring"""

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


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



