




'''simple docstring'''







import sys





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

    UpperCAmelCase      	=		UpperCAmelCase      	=		UpperCAmelCase      	=		0
    UpperCAmelCase      	=		sys.maxsize

    while right < len(_a					):
        curr_sum += numbers[right]
        while curr_sum >= target and left <= right:
            UpperCAmelCase      	=		min(_a   ,       right - left + 1					)
            curr_sum -= numbers[left]
            left += 1
        right += 1

    return 0 if min_len == sys.maxsize else min_len










'''simple docstring'''







def 						snake_case_							(_a     :							int = 9_9_8_0_0_1					):
    UpperCAmelCase      	=		0
    for i in range(9_9_9   ,       9_9   ,       -1					):  # 3 digit numbers range from 999 down to 100
        for j in range(9_9_9   ,       9_9   ,       -1					):
            UpperCAmelCase      	=		str(i * j					)
            if product_string == product_string[::-1] and i * j < n:
                UpperCAmelCase      	=		max(_a   ,       i * j					)
    return answer


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




