import os
from math import logaa





def  _lowerCamelCase					(   a_				: str = "base_exp.txt"):
			lowerCamelCase						:float						  =     0
			lowerCamelCase						:Optional[int]						  =     0
			for i, line in enumerate(open(os.path.join(os.path.dirname(a_)						,			a_))):
						lowerCamelCase  ,    lowerCamelCase						:Optional[int]						  =     list(map(a_						,			line.split(''',''')))
						if x * logaa(a_) > largest:
									lowerCamelCase						:List[Any]						  =     x * logaa(a_)
									lowerCamelCase						:Any						  =     i + 1
			return result


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




import math





def  _lowerCamelCase					(   a_				: int):

			if 1 < number < 4:
						# 2 and 3 are primes
						return True
			elif number < 2 or number % 2 == 0 or number % 3 == 0:
						# Negatives, 0, 1, all even numbers, all multiples of 3 are not primes
						return False

			# All primes number are in format of 6k +/- 1
			for i in range(5						,			int(math.sqrt(a_) + 1)						,			6):
						if number % i == 0 or number % (i + 2) == 0:
									return False
			return True





def  _lowerCamelCase					(   a_				: float = 0.1):
			lowerCamelCase						:Dict						  =     3
			lowerCamelCase						:List[Any]						  =     3

			while primes / (2 * j - 1) >= ratio:
						for i in range(j * j + j + 1						,			(j + 2) * (j + 2)						,			j + 1):
									primes += is_prime(a_)
						j += 2
			return j


if __name__ == "__main__":
			import doctest

			doctest.testmod()



