




def 		a_							( __lowerCAmelCase = 4_00_00_00				):
  lowerCAmelCase__										=      []
  lowerCAmelCase__				,      lowerCAmelCase__										=      0, 1
  while b <= n:
    if b % 2 == 0:
      even_fibs.append(__lowerCAmelCase				)
    lowerCAmelCase__				,      lowerCAmelCase__										=      b, a + b
  return sum(__lowerCAmelCase				)


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







from __future__ import annotations
def 		a_							( __lowerCAmelCase				):
  if not nums:
    return 0
  lowerCAmelCase__										=      nums[0]
  lowerCAmelCase__										=      0
  for num in nums[1:]:
    lowerCAmelCase__				,      lowerCAmelCase__										=      (
        max_excluding + num,
        max(__lowerCAmelCase   , __lowerCAmelCase				),
    )
  return max(__lowerCAmelCase   , __lowerCAmelCase				)


if __name__ == "__main__":
      import doctest

      doctest.testmod()

