


"""simple docstring"""





import math


def      _snake_case						(						_snake_case				:			int			):

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


def      _snake_case						(						_snake_case				:			float = 0.1			):
      lowerCAmelCase					:	Optional[Any]       =   3
      lowerCAmelCase					:	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(_snake_case			)
            j += 2
      return j


if __name__ == "__main__":
 import doctest

 doctest.testmod()






"""simple docstring"""





def      _snake_case						(						_snake_case				:			int = 4000000			):
      lowerCAmelCase					:	int       =   [0, 1]
      lowerCAmelCase					:	List[str]       =   0
      while fib[i] <= n:
            fib.append(fib[i] + fib[i + 1]			)
            if fib[i + 2] > n:
                  break
            i += 1
      lowerCAmelCase					:	int       =   0
      for j in range(len(_snake_case			) - 1			):
            if fib[j] % 2 == 0:
                  total += fib[j]

      return total


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


