





'''simple docstring'''
def     lowercase__       (       __lowercase						:  int = 998001					)			->				int:



       """simple docstring"""






       for number in range(n - 1    ,  9999    ,  -1					):
              __UpperCamelCase	=  str(__lowercase					)

              # checks whether 'str_number' is a palindrome.
              if str_number == str_number[::-1]:
                     __UpperCamelCase	=  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() = }')







'''simple docstring'''
def     lowercase__       (       __lowercase						:  str    ,  __lowercase						:  Tuple					)			->				str:



       """simple docstring"""






       sequence.append(__lowercase					)

       __UpperCamelCase	=  0
       while sequence[index] != target:
              index += 1

       sequence.pop()

       if index == len(__lowercase					):
              return None

       return index


if __name__ == "__main__":
    a__							:							Any			=input('''Enter numbers separated by comma:\n''').strip()
    a__							:							Any			=[int(item) for item in user_input.split(''',''')]

    a__							:							Tuple			=input('''Enter a single number to be found in the list:\n''')
    a__							:							List[Any]			=int(target_input)
    a__							:							List[Any]			=sentinel_linear_search(sequence, target)
    if result is not None:
        print(f'{target} found at positions: {result}')
    else:
        print('''Not found''')
