





"""simple docstring"""



def 		__lowercase					(       snake_case_  :  int = 4000000						)       ->int:



    '''simple docstring'''







    __A   :						Optional[int]									=					[0, 1]
    __A   :						List[Any]									=					0
    while fib[i] <= n:
        fib.append(fib[i] + fib[i + 1]						)
        if fib[i + 2] > n:
            break
        i += 1
    __A   :						Tuple									=					0
    for j in range(len(_A						) - 1						):
        if fib[j] % 2 == 0:
            total += fib[j]

    return total


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











"""simple docstring"""



import math
from collections.abc import Iterator
from itertools import takewhile







def 		__lowercase					(       snake_case_  :  int						)       ->bool:



    '''simple docstring'''







    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 		__lowercase					(       )       ->Iterator[int]:



    '''simple docstring'''







    __A   :						int									=					2
    while True:
        if is_prime(snake_case_						):
            yield num
        num += 1







def 		__lowercase					(       snake_case_  :  int = 2000000						)       ->int:



    '''simple docstring'''







    return sum(takewhile(lambda snake_case_						: x < n    ,prime_generator()						)						)


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




