




'''simple docstring'''



import math

from numpy import inf
from scipy.integrate import quad







def       _UpperCamelCase			(_lowerCamelCase				:  float						)-> float:




     '''simple docstring'''





     if num <= 0:
          raise ValueError('''math domain error'''						)

     return quad(_lowerCamelCase ,						0 ,						_lowerCamelCase ,						args=(_lowerCamelCase)						)[0]







def       _UpperCamelCase			(_lowerCamelCase				:  float ,						_lowerCamelCase				:  float						)-> float:




     '''simple docstring'''





     return math.pow(_lowerCamelCase ,						z - 1						) * math.exp(-x						)


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

     testmod()









def 			_A	(      SCREAMING_SNAKE_CASE      ):
	stooge(SCREAMING_SNAKE_CASE	,0	,len(SCREAMING_SNAKE_CASE      ) - 1      )
	return arr



def 			_A	(      SCREAMING_SNAKE_CASE	,SCREAMING_SNAKE_CASE	,SCREAMING_SNAKE_CASE      ):
	if i >= h:
		return

	# If first element is smaller than the last then swap them
	if arr[i] > arr[h]:
		UpperCAmelCase__							,						UpperCAmelCase__:	int									= arr[h], arr[i]

	# If there are more than 2 elements in the array
	if h - i + 1 > 2:
		UpperCAmelCase__:	str									= (int)((h - i + 1) / 3      )

		# Recursively sort first 2/3 elements
		stooge(SCREAMING_SNAKE_CASE	,SCREAMING_SNAKE_CASE	,(h - t)      )

		# Recursively sort last 2/3 elements
		stooge(SCREAMING_SNAKE_CASE	,i + t	,(SCREAMING_SNAKE_CASE)      )

		# Recursively sort first 2/3 elements
		stooge(SCREAMING_SNAKE_CASE	,SCREAMING_SNAKE_CASE	,(h - t)      )


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