




"""simple docstring"""
class __lowercase:




					'''simple docstring'''


					def __init__(    self						,	__a						,	__a						,	__a     ):
								__lowerCamelCase					:	List[Any]	       =				name
								__lowerCamelCase					:	str	       =				value
								__lowerCamelCase					:	Dict	       =				weight
					def __repr__(    self     ):
								return f'''{self.__class__.__name__}({self.name}, {self.value}, {self.weight})'''
					def     snake_case_				(    self     ):
								return self.value
					def     snake_case_				(    self     ):
								return self.name
					def     snake_case_				(    self     ):
								return self.weight





					def     snake_case_				(    self     ):
								return self.value / self.weight





def 						UpperCAmelCase				(			A__:    Union[str, Any]							,				A__:    List[Any]							,				A__:    List[Any]     )  ->     Optional[int]:
			__lowerCamelCase					:	int	       =				[]
			for i in range(len(__lowerCAmelCase     )     ):
						menu.append(Things(name[i]							,				value[i]							,				weight[i]     )     )
			return menu





def 						UpperCAmelCase				(			A__:    Union[str, Any]							,				A__:    str							,				A__:    int     )  ->     Any:
			__lowerCamelCase					:	Optional[Any]	       =				sorted(__lowerCAmelCase							,				key=__lowerCAmelCase							,				reverse=__lowerCAmelCase     )
			__lowerCamelCase					:	int	       =				[]
			__lowerCamelCase       ,      __lowerCamelCase					:	int	       =				0.0, 0.0
			for i in range(len(__lowerCAmelCase     )     ):
						if (total_cost + items_copy[i].get_weight()) <= max_cost:
									result.append(items_copy[i]     )
									total_cost += items_copy[i].get_weight()
									total_value += items_copy[i].get_value()
			return (result, total_value)





def 						UpperCAmelCase				(			)  ->     List[str]:
			pass




if __name__ == "__main__":
					import doctest

					doctest.testmod()









"""simple docstring"""
def 						UpperCAmelCase				(			A__:    Dict     )  ->     Optional[int]:
			stooge(A__							,				0							,				len(A__     ) - 1     )
			return arr





def 						UpperCAmelCase				(			A__:    Dict							,				A__:    List[str]							,				A__:    Optional[int]     )  ->     Any:
			if i >= h:
						return

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

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

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

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

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


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



