
from __future__ import annotations

from collections.abc import Generator


def 						UpperCAmelCase			(	)		->	Generator[int, None, None]:







				"""simple docstring"""



				__A   			= {}
				__A   			= 2
				while True:
								__A   			= factor_map.pop(a_		,   a_						)
								if factor:
												__A   			= factor + prime
												while x in factor_map:
																x += factor
												__A   			= factor
								else:
												__A   			= prime
												yield prime
								prime += 1


def 						UpperCAmelCase			(	a_ = 1E10						)		->	int:







				"""simple docstring"""



				__A   			= sieve()

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


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






from __future__ import annotations

import numpy as np







def 				lowerCAmelCase_	(     snake_case_     ):
      return np.maximum(0,snake_case_     )


if __name__ == "__main__":
  print(np.array(relu([-1, 0, 5])))  # --> [0, 0, 5]

