





'''simple docstring'''







def 		SCREAMING_SNAKE_CASE      (					lowerCAmelCase__     :	list[int])			->						tuple[int, int]:

     '''simple docstring'''




     if len(lowerCAmelCase__) == 1:
          return a[0], a[0]
     else:
          # split A into half.
          _lowercase							:      Optional[Any]  						=							a[: len(lowerCAmelCase__) // 2]
          _lowercase							:      int  						=							a[len(lowerCAmelCase__) // 2 :]

          # 2 sub problems, 1/2 of original size.
          _lowercase						, _lowercase							:      Any  						=							max_difference(lowerCAmelCase__)
          _lowercase						, _lowercase							:      int  						=							max_difference(lowerCAmelCase__)

          # get min of first and max of second
          # linear time
          _lowercase							:      List[Any]  						=							min(lowerCAmelCase__)
          _lowercase							:      List[str]  						=							max(lowerCAmelCase__)

          # 3 cases, either (small1, big1),
          # (min_first, max_second), (small2, big2)
          # constant comparisons
          if biga - smalla > max_second - min_first and biga - smalla > biga - smalla:
               return smalla, biga
          elif biga - smalla > max_second - min_first:
               return smalla, biga
          else:
               return min_first, max_second


if __name__ == "__main__":
    import doctest

    doctest.testmod()






'''simple docstring'''







def 		SCREAMING_SNAKE_CASE      (					lowerCAmelCase__     :	str)			->						str:

     '''simple docstring'''




     return " ".join(sorted(set(sentence.split())))


if __name__ == "__main__":
    import doctest

    doctest.testmod()