

import math

def 							__SCREAMING_SNAKE_CASE							(				lowerCAmelCase:  int )   ->       bool:

				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(lowerCAmelCase ) + 1 )  ,      6 ):
								if number % i == 0 or number % (i + 2) == 0:
												return False
				return True

def 							__SCREAMING_SNAKE_CASE							(				lowerCAmelCase:  float = 0.1 )   ->       int:
				_UpperCAmelCase       :		List[str] 		=    3
				_UpperCAmelCase       :		Tuple 		=    3

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


if __name__ == "__main__":
					import doctest

					doctest.testmod()





from __future__ import annotations

import numpy as np

def 							__SCREAMING_SNAKE_CASE							(				lowerCAmelCase:  list[float] )   ->       Dict:
				return np.maximum(0  ,      lowerCAmelCase )


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


