


"""simple docstring"""







def 					a__			(				SCREAMING_SNAKE_CASE    :    list[int]				):


  '''simple docstring'''







  if not numbers:
    return 0

  if not isinstance(SCREAMING_SNAKE_CASE				,      (list, tuple)				) or not all(
      isinstance(SCREAMING_SNAKE_CASE				,      SCREAMING_SNAKE_CASE				) for number in numbers				):
    raise ValueError("numbers must be an iterable of integers"				)

  lowerCAmelCase     :     str								=							numbers[0]

  for i in range(1				,      len(SCREAMING_SNAKE_CASE				)				):
    # update the maximum and minimum subarray products
    lowerCAmelCase     :     int								=							numbers[i]
    if number < 0:
      lowerCAmelCase						,  lowerCAmelCase     :     Union[str, Any]								=							min_till_now, max_till_now
    lowerCAmelCase     :     List[Any]								=							max(SCREAMING_SNAKE_CASE				,      max_till_now * number				)
    lowerCAmelCase     :     List[Any]								=							min(SCREAMING_SNAKE_CASE				,      min_till_now * number				)

    # update the maximum product found till now
    lowerCAmelCase     :     str								=							max(SCREAMING_SNAKE_CASE				,      SCREAMING_SNAKE_CASE				)

  return max_prod










import random

from .binary_exp_mod import bin_exp_mod



def 			_lowerCAmelCase       (					__lowerCAmelCase  ,  __lowerCAmelCase=1000      )   ->					str:


				"""simple docstring"""

				if n < 2:
								return False

				if n % 2 == 0:
								return n == 2

				# this means n is odd
				snake_case__	:      Tuple     		=	n - 1
				snake_case__	:      Tuple     		=	0
				while d % 2 == 0:
								d /= 2
								exp += 1

				# n - 1=d*(2**exp)
				snake_case__	:      List[str]     		=	0
				while count < prec:
								snake_case__	:      List[str]     		=	random.randint(2  ,  n - 1      )
								snake_case__	:      Optional[Any]     		=	bin_exp_mod(__lowerCAmelCase  ,  __lowerCAmelCase  ,  __lowerCAmelCase      )
								if b != 1:
												snake_case__	:      List[Any]     		=	True
												for _ in range(__lowerCAmelCase      ):
																if b == n - 1:
																				snake_case__	:      List[str]     		=	False
																				break
																snake_case__	:      str     		=	b * b
																b %= n
												if flag:
																return False
												count += 1
				return True


if __name__ == "__main__":
				A__								=						abs(int(input('''Enter bound : ''').strip()))
				print('''Here\'s the list of primes:''')
				print(''', '''.join(str(i) for i in range(n + 1) if is_prime_big(i)))

