



"""simple docstring"""






from __future__ import annotations

from collections.abc import Generator


def 			_lowercase				(  )						->   Generator[int, None, None]:
			__lowerCAmelCase      :  dict[int, int]												=       {}
			__lowerCAmelCase      :  List[Any]												=       2
			while True:
						__lowerCAmelCase      :  int												=       factor_map.pop(__snake_case					,__snake_case	)
						if factor:
									__lowerCAmelCase      :  Union[str, Any]												=       factor + prime
									while x in factor_map:
												x += factor
									__lowerCAmelCase      :  str												=       factor
						else:
									__lowerCAmelCase      :  List[str]												=       prime
									yield prime
						prime += 1


def 			_lowercase				(  __snake_case = 1e1_0	)						->   int:
			__lowerCAmelCase      :  List[Any]												=       sieve()

			__lowerCAmelCase      :  List[Any]												=       1
			while True:
						__lowerCAmelCase      :  Union[str, Any]												=       next(__snake_case	)
						if (2 * prime * n) > limit:
									return n
						# Ignore the next prime as the reminder will be 2.
						next(__snake_case	)
						n += 2


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




"""simple docstring"""






import os
from math import logaa


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


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