




'''simple docstring'''





def 				UpperCamelCase	(  snake_case	,     snake_case	,     snake_case   ):




   '''simple docstring'''

   if right <= left:
      return
   SCREAMING_SNAKE_CASE__			:				Dict       						= left
   SCREAMING_SNAKE_CASE__			:				List[Any]       						= right
   SCREAMING_SNAKE_CASE__			:				List[Any]       						= sorting[left]
   while i <= b:
      if sorting[i] < pivot:
         SCREAMING_SNAKE_CASE__						,				SCREAMING_SNAKE_CASE__			:				Tuple       						= sorting[i], sorting[a]
         a += 1
         i += 1
      elif sorting[i] > pivot:
         SCREAMING_SNAKE_CASE__						,				SCREAMING_SNAKE_CASE__			:				Optional[int]       						= sorting[i], sorting[b]
         b -= 1
      else:
         i += 1
   quick_sort_apartition(snake_case	,     snake_case	,     a - 1   )
   quick_sort_apartition(snake_case	,     b + 1	,     snake_case   )


def 				UpperCamelCase	(  snake_case	,     snake_case	,     snake_case   ):




   '''simple docstring'''

   if left < right:
      SCREAMING_SNAKE_CASE__			:				Optional[int]       						= lomuto_partition(snake_case	,     snake_case	,     snake_case   )
      quick_sort_lomuto_partition(snake_case	,     snake_case	,     pivot_index - 1   )
      quick_sort_lomuto_partition(snake_case	,     pivot_index + 1	,     snake_case   )


def 				UpperCamelCase	(  snake_case	,     snake_case	,     snake_case   ):




   '''simple docstring'''

   SCREAMING_SNAKE_CASE__			:				Union[str, Any]       						= sorting[right]
   SCREAMING_SNAKE_CASE__			:				Optional[int]       						= left
   for i in range(snake_case	,     snake_case   ):
      if sorting[i] < pivot:
         SCREAMING_SNAKE_CASE__						,				SCREAMING_SNAKE_CASE__			:				Optional[int]       						= sorting[i], sorting[store_index]
         store_index += 1
   SCREAMING_SNAKE_CASE__						,				SCREAMING_SNAKE_CASE__			:				List[str]       						= sorting[store_index], sorting[right]
   return store_index


def 				UpperCamelCase	(  snake_case   ):




   '''simple docstring'''

   if len(snake_case   ) <= 1:
      return sorting
   return (
       three_way_radix_quicksort([i for i in sorting if i < sorting[0]]   )
       + [i for i in sorting if i == sorting[0]]
       + three_way_radix_quicksort([i for i in sorting if i > sorting[0]]   )
   )


if __name__ == "__main__":
       import doctest

       doctest.testmod(verbose=True)

       lowercase__			=	input('''Enter numbers separated by a comma:\n''').strip()
       lowercase__			=	[int(item) for item in user_input.split(''',''')]
       quick_sort_apartition(unsorted, 0, len(unsorted) - 1)
       print(unsorted)







'''simple docstring'''





def 				UpperCamelCase	(  snake_case = 99_80_01   ):




   '''simple docstring'''

   for number in range(n - 1	,     99_99	,     -1   ):
      SCREAMING_SNAKE_CASE__			:				int       						= str(snake_case   )

      # checks whether 'str_number' is a palindrome.
      if str_number == str_number[::-1]:
         SCREAMING_SNAKE_CASE__			:				Any       						= 9_99

         # if 'number' is a product of two 3-digit numbers
         # then number is the answer otherwise fetch next number.
         while divisor != 99:
            if (number % divisor == 0) and (len(str(number // divisor   )   ) == 3.0):
               return number
            divisor -= 1
   raise ValueError('''That number is larger than our acceptable range.'''   )


if __name__ == "__main__":
       print(F"{solution() = }")

