
import sys


def     UpperCamelCase      (					__lowerCamelCase  :				int       ,      __lowerCamelCase  :				list[int]					):
       if not numbers:
              return 0
       if target == 0 and target in numbers:
              return 0
       if not isinstance(__lowerCamelCase       ,      (list, tuple)					) or not all(
           isinstance(__lowerCamelCase       ,      __lowerCamelCase					) for number in numbers					):
              raise ValueError("numbers must be an iterable of integers"					)

       snake_case :     Optional[int]           =   0
       snake_case :     List[Any]           =   sys.maxsize

       while right < len(__lowerCamelCase					):
              curr_sum += numbers[right]
              while curr_sum >= target and left <= right:
                     snake_case :     List[str]           =   min(__lowerCamelCase       ,      right - left + 1					)
                     curr_sum -= numbers[left]
                     left += 1
              right += 1

       return 0 if min_len == sys.maxsize else min_len







def     UpperCamelCase      (					__lowerCamelCase  :				int = 998001					):
       snake_case :     Optional[Any]           =   0
       for i in range(999       ,      99       ,      -1					):  # 3 digit numbers range from 999 down to 100
              for j in range(999       ,      99       ,      -1					):
                     snake_case :     Tuple           =   str(i * j					)
                     if product_string == product_string[::-1] and i * j < n:
                            snake_case :     str           =   max(__lowerCamelCase       ,      i * j					)
       return answer


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





