


def 					lowerCamelCase_   (	_a	):




		"""simple docstring"""






		if number < 0:
				raise ValueError('''number must not be negative'''	)
		return number & (number - 1) == 0


if __name__ == "__main__":
		import doctest

		doctest.testmod()








import random

from .binary_exp_mod import bin_exp_mod






def 					lowerCamelCase_   (	_a     ,       _a=1_000	):




		"""simple docstring"""






		if n < 2:
				return False

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

		# this means n is odd
		lowerCAmelCase__       :      int   					= n - 1
		lowerCAmelCase__       :      Any   					= 0
		while d % 2 == 0:
				d /= 2
				exp += 1

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


if __name__ == "__main__":
		lowerCamelCase						=		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)))




