

lowerCAmelCase_       	=	6_55_21


def   __SCREAMING_SNAKE_CASE					(SCREAMING_SNAKE_CASE__       ):
						snake_case_   =	1
						snake_case_   =	0
						for plain_chr in plain_text:
												snake_case_   =	(a + ord(SCREAMING_SNAKE_CASE__       )) % MOD_ADLER
												snake_case_   =	(b + a) % MOD_ADLER
						return (b << 16) | a


from __future__ import annotations

from collections.abc import Generator


def   __SCREAMING_SNAKE_CASE					():
						snake_case_   =	{}
						snake_case_   =	2
						while True:
												snake_case_   =	factor_map.pop(SCREAMING_SNAKE_CASE__  ,		SCREAMING_SNAKE_CASE__       )
												if factor:
																		snake_case_   =	factor + prime
																		while x in factor_map:
																								x += factor
																		snake_case_   =	factor
												else:
																		snake_case_   =	prime
																		yield prime
												prime += 1


def   __SCREAMING_SNAKE_CASE					(SCREAMING_SNAKE_CASE__ = 1E10       ):
						snake_case_   =	sieve()

						snake_case_   =	1
						while True:
												snake_case_   =	next(SCREAMING_SNAKE_CASE__       )
												if (2 * prime * n) > limit:
																		return n
												# Ignore the next prime as the reminder will be 2.
												next(SCREAMING_SNAKE_CASE__       )
												n += 2


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