



'''simple docstring'''





def 			a_	(				_lowerCAmelCase = 4000000			) -> str:
  __lowerCamelCase			:			List[Any]       			=					[]
  __lowerCamelCase			,__lowerCamelCase			:			Any       			=					0, 1
  while b <= n:
    if b % 2 == 0:
      even_fibs.append(__lowerCAmelCase			)
    __lowerCamelCase			,__lowerCamelCase			:			str       			=					b, a + b
  return sum(__lowerCAmelCase			)


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












import numpy as np
def 		a_							( __lowerCAmelCase   , __lowerCAmelCase   , __lowerCAmelCase   , __lowerCAmelCase   , __lowerCAmelCase				):
  lowerCAmelCase__										=      int(np.ceil((x_end - xa) / h				)				)
  lowerCAmelCase__										=      np.zeros((n + 1,)				)
  lowerCAmelCase__										=      ya
  lowerCAmelCase__										=      xa

  for k in range(__lowerCAmelCase				):
    lowerCAmelCase__										=      f(__lowerCAmelCase   , y[k]				)
    lowerCAmelCase__										=      f(x + 0.5 * h   , y[k] + 0.5 * h * ka				)
    lowerCAmelCase__										=      f(x + 0.5 * h   , y[k] + 0.5 * h * ka				)
    lowerCAmelCase__										=      f(x + h   , y[k] + h * ka				)
    lowerCAmelCase__										=      y[k] + (1 / 6) * h * (ka + 2 * ka + 2 * ka + ka)
    x += h

  return y


if __name__ == "__main__":
      import doctest

      doctest.testmod()

