
def 							A__       (    lowerCamelCase = 4_00_00_00    )	->						int:
				UpperCamelCase_:				Dict						=    []
				UpperCamelCase_, UpperCamelCase_:				Optional[int]						=    0, 1
				while b <= n:
								if b % 2 == 0:
												even_fibs.append(lowerCamelCase    )
								UpperCamelCase_, UpperCamelCase_:				int						=    b, a + b
				return sum(lowerCamelCase    )


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








from __future__ import annotations







def 							A__       (    lowerCamelCase    )	->						int:
				UpperCamelCase_:				Optional[Any]						=    len(lowerCamelCase    ) // 2

				# choose the middle 3 elements
				UpperCamelCase_:				Tuple						=    lst[m - 1 : m + 2]

				# if middle element is peak
				if three[1] > three[0] and three[1] > three[2]:
								return three[1]

				# if increasing, recurse on right
				elif three[0] < three[2]:
								if len(lst[:m]    ) == 2:
												m -= 1
								return peak(lst[m:]    )

				# decreasing
				else:
								if len(lst[:m]    ) == 2:
												m += 1
								return peak(lst[:m]    )


if __name__ == "__main__":
							import doctest

							doctest.testmod()






