

"""simple docstring"""




def       snake_case__    (       lowerCAmelCase_ = 998001      ):





     """simple docstring"""







     for number in range(n - 1,   9999,   -1      ):
          SCREAMING_SNAKE_CASE										=str(lowerCAmelCase_      )

          # checks whether 'str_number' is a palindrome.
          if str_number == str_number[::-1]:
               SCREAMING_SNAKE_CASE										=999

               # 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() = }')




def       snake_case__    (       lowerCAmelCase_      ):





     """simple docstring"""







     SCREAMING_SNAKE_CASE										=len(lowerCAmelCase_      )
     for _ in range(
         0,   int(((no_of_elements - 1) / 2) + 1      )      ):  # we don't need to traverse to end of list as
          for j in range(0,   no_of_elements - 1      ):
               if (
                   lst[j + 1] < lst[j]
               ):  # applying bubble sort algorithm from left to right (or forwards)
                    SCREAMING_SNAKE_CASE										=lst[j + 1]
                    SCREAMING_SNAKE_CASE										=lst[j]
                    SCREAMING_SNAKE_CASE										=temp
               if (
                   lst[no_of_elements - 1 - j] < lst[no_of_elements - 2 - j]
               ):  # applying bubble sort algorithm from right to left (or backwards)
                    SCREAMING_SNAKE_CASE										=lst[no_of_elements - 1 - j]
                    SCREAMING_SNAKE_CASE										=lst[no_of_elements - 2 - j]
                    SCREAMING_SNAKE_CASE										=temp
     return lst


if __name__ == "__main__":
 print("enter the list to be sorted")
 _lowerCamelCase								=[int(x) for x in input().split()]  # inputing elements of the list in one line
 _lowerCamelCase								=double_sort(lst)
 print("the sorted list is")
 print(sorted_lst)

