



'''simple docstring'''

from math import isqrt






def    __lowercase	(_SCREAMING_SNAKE_CASE   :Tuple							):
				return all(number % divisor != 0 for divisor in range(2     ,						isqrt(_SCREAMING_SNAKE_CASE							) + 1							)							)






def    __lowercase	(_SCREAMING_SNAKE_CASE   :List[str] = 10**6							):
				SCREAMING_SNAKE_CASE	:    Union[str, Any]          =			0
				SCREAMING_SNAKE_CASE	:    Dict          =			1
				SCREAMING_SNAKE_CASE	:    str          =			7
				while prime_candidate < max_prime:
								primes_count += is_prime(_SCREAMING_SNAKE_CASE							)

								cube_index += 1
								prime_candidate += 6 * cube_index

				return primes_count


if __name__ == "__main__":
	print(f'''{solution() = }''')








'''simple docstring'''






from collections.abc import Callable

import numpy as np


def    _snake_case  (	A					,       A					,       A					,       A					,       A			)		->       np.array:
							lowerCAmelCase__			  =      int(np.ceil((x_end - xa) / step_size			)			)
							lowerCAmelCase__			  =      np.zeros((n + 1,)			)
							lowerCAmelCase__			  =      ya
							lowerCAmelCase__			  =      xa

							for k in range(A			):
														lowerCAmelCase__			  =      y[k] + step_size * ode_func(A					,       y[k]			)
														lowerCAmelCase__			  =      y[k] + (
														    (step_size / 2) * (ode_func(A					,       y[k]			) + ode_func(x + step_size					,       A			))
														)
														x += step_size

							return y


if __name__ == "__main__":
		import doctest

		doctest.testmod()