



'''simple docstring'''

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

		return total


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












"""simple docstring"""


class 					snake_case		:


   '''simple docstring'''

   def __init__(	self :     List[str],       _lowerCamelCase :     list[int]  ):

     '''simple docstring'''
     __A									= len(_lowerCamelCase  )
     __A									= [0] * len_array

     if len_array > 0:
       __A									= array[0]

     for i in range(1,       _lowerCamelCase  ):
       __A									= self.prefix_sum[i - 1] + array[i]


   def 				_SCREAMING_SNAKE_CASE				(	self :     List[Any],       _lowerCamelCase :     int,       _lowerCamelCase :     int  ):

     '''simple docstring'''
     if start == 0:
       return self.prefix_sum[end]

     return self.prefix_sum[end] - self.prefix_sum[start - 1]






   def 				_SCREAMING_SNAKE_CASE				(	self :     List[str],       _lowerCamelCase :     int  ):

     '''simple docstring'''
     __A									= {0}
     for sum_item in self.prefix_sum:
       if sum_item - target_sum in sums:
         return True

       sums.add(_lowerCamelCase  )

     return False


if __name__ == "__main__":
       import doctest

       doctest.testmod()




