



'''simple docstring'''





def        lowerCamelCase  (				_snake_case  :						int = 4_000_000       ):





    '''simple docstring'''


    lowercase__		       =						[0, 1]
    lowercase__		       =						0
    while fib[i] <= n:
        fib.append(fib[i] + fib[i + 1]       )
        if fib[i + 2] > n:
            break
        i += 1
    lowercase__		       =						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() = }''')









'''simple docstring'''





def        lowerCamelCase  (				_snake_case  :						int     ,_snake_case  :						int       ):





    '''simple docstring'''


    return x if y == 0 else greatest_common_divisor(_snake_case     ,x % y       )




def        lowerCamelCase  (				_snake_case  :						int     ,_snake_case  :						int       ):





    '''simple docstring'''


    return (x * y) // greatest_common_divisor(_snake_case     ,_snake_case       )




def        lowerCamelCase  (				_snake_case  :						int = 20       ):





    '''simple docstring'''


    lowercase__		       =						1
    for i in range(1     ,n + 1       ):
        lowercase__		       =						lcm(_snake_case     ,_snake_case       )
    return g


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




