





def    A_(			A   ):
	stooge(A				,      0				,      len(A   ) - 1   )
	return arr




def    A_(			A				,      A				,      A   ):
	if i >= h:
		return

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

	# If there are more than 2 elements in the array
	if h - i + 1 > 2:
		UpperCAmelCase_								=     (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__":
				UpperCamelCase__   : Dict					  = input("""Enter numbers separated by a comma:\n""").strip()
				UpperCamelCase__   : Optional[int]					  = [int(item) for item in user_input.split(""",""")]
				print(stooge_sort(unsorted))









from torch import nn







class   _UpperCamelCase  (       nn.Module  ):







					'''simple docstring'''

					def __init__(						self    :  Dict ,					__lowercase    :  List[str] ,					__lowercase    :  Dict		):






						'''simple docstring'''







						super().__init__()
						UpperCAmelCase_								=     class_size
						UpperCAmelCase_								=     embed_size
						# self.mlp1 = nn.Linear(embed_size, embed_size)
						# self.mlp2 = (nn.Linear(embed_size, class_size))
						UpperCAmelCase_								=     nn.Linear(__lowercase ,					__lowercase		)





					def        SCREAMING_SNAKE_CASE							(						self    :  Any ,					__lowercase    :  Optional[Any]		):






						'''simple docstring'''







						UpperCAmelCase_								=     self.mlp(__lowercase		)
						return logits


