
"""simple docstring"""




def 			_lowerCAmelCase		(		_UpperCamelCase    ):






  """simple docstring"""



  return " ".join(input_str.split()[::-1]    )


if __name__ == "__main__":
  import doctest

  doctest.testmod()


"""simple docstring"""




def 			_lowerCAmelCase		(		_UpperCamelCase    ):






  """simple docstring"""



  stooge(_UpperCamelCase			,					0			,					len(_UpperCamelCase    ) - 1    )
  return arr




def 			_lowerCAmelCase		(		_UpperCamelCase			,					_UpperCamelCase			,					_UpperCamelCase    ):






  """simple docstring"""



  if i >= h:
    return

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

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

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

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

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


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