

import math

def 			lowerCamelCase__			(       _a):

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

def 			lowerCamelCase__			(       _a = 0.1):
	SCREAMING_SNAKE_CASE :   int					  =							3
	SCREAMING_SNAKE_CASE :   List[Any]					  =							3

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


if __name__ == "__main__":
			import doctest

			doctest.testmod()

def       _SCREAMING_SNAKE_CASE   (						_lowerCamelCase					:     int = 10**9)   ->       int:






							'''simple docstring'''





							__UpperCamelCase      :  int       =   1
							__UpperCamelCase      :  Any       =   2

							__UpperCamelCase      :  Dict       =   0
							__UpperCamelCase      :  Any       =   0
							__UpperCamelCase      :  List[Any]       =   0
							while perimeter <= max_perimeter:
														perimeters_sum += perimeter

														prev_value += 2 * value
														value += prev_value

														__UpperCamelCase      :  Optional[int]       =   2 * value + 2 if i % 2 == 0 else 2 * value - 2
														i += 1

							return perimeters_sum


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