


def        lowerCAmelCase__ (			a__:		List[Any] = 4_0_0_0_0_0_0       )  ->		int:


							'''simple docstring'''





							_UpperCAmelCase 		=			[]
							_UpperCAmelCase 		=			0, 1
							while b <= n:
														if b % 2 == 0:
																					even_fibs.append(_SCREAMING_SNAKE_CASE       )
														_UpperCAmelCase 		=			b, a + b
							return sum(_SCREAMING_SNAKE_CASE       )


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

"""simple docstring"""
import math







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







def 						__a   (	_SCREAMING_SNAKE_CASE = 0.1   )	->int:
  a__:     str										=	3
  a__:     Optional[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(_SCREAMING_SNAKE_CASE   )
    j += 2
  return j


if __name__ == "__main__":
 import doctest

 doctest.testmod()


