from __future__ import annotations




def        lowerCAmelCase_			(					__A							)					->    list[int]:  # This function is recursive







      '''simple docstring'''


      UpperCAmelCase__								=  len(__A							)
      # If the array contains only one element, we return it (it's the stop condition of
      # recursion)
      if array_length <= 1:
            return array
            # Else
      UpperCAmelCase__								=  array[0]
      UpperCAmelCase__								=  False
      UpperCAmelCase__								=  1
      UpperCAmelCase__								=  []
      while not is_found and i < array_length:
            if array[i] < pivot:
                  UpperCAmelCase__								=  True
                  UpperCAmelCase__								=  [element for element in array[i:] if element >= array[i]]
                  UpperCAmelCase__								=  longest_subsequence(__A							)
                  if len(__A							) > len(__A							):
                        UpperCAmelCase__								=  temp_array
            else:
                  i += 1

      UpperCAmelCase__								=  [element for element in array[1:] if element >= pivot]
      UpperCAmelCase__								=  [pivot, *longest_subsequence(__A							)]
      if len(__A							) > len(__A							):
            return temp_array
      else:
            return longest_subseq


if __name__ == "__main__":
      import doctest

      doctest.testmod()




def        lowerCAmelCase_			(					__A							)					->    str:







      '''simple docstring'''


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


if __name__ == "__main__":
      import doctest

      doctest.testmod()



