
import os
from math import logaa



def        UpperCamelCase    (							lowerCAmelCase__ = "base_exp.txt"		):
					'''simple docstring'''
					lowercase							=						0
					lowercase							=						0
					for i, line in enumerate(open(os.path.join(os.path.dirname(lowerCAmelCase__		) ,			lowerCAmelCase__		)		)		):
										lowercase	,						lowercase							=						list(map(lowerCAmelCase__ ,			line.split(''','''		)		)		)
										if x * logaa(lowerCAmelCase__		) > largest:
															lowercase							=						x * logaa(lowerCAmelCase__		)
															lowercase							=						i + 1
					return result


if __name__ == "__main__":
							print(solution())






import random

from .binary_exp_mod import bin_exp_mod



def        UpperCamelCase    (							lowerCAmelCase__ ,			lowerCAmelCase__=1000		):
					'''simple docstring'''
					if n < 2:
										return False

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

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

					# n - 1=d*(2**exp)
					lowercase							=						0
					while count < prec:
										lowercase							=						random.randint(2 ,			n - 1		)
										lowercase							=						bin_exp_mod(lowerCAmelCase__ ,			lowerCAmelCase__ ,			lowerCAmelCase__		)
										if b != 1:
															lowercase							=						True
															for _ in range(lowerCAmelCase__		):
																				if b == n - 1:
																									lowercase							=						False
																									break
																				lowercase							=						b * b
																				b %= n
															if flag:
																				return False
															count += 1
					return True


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




