






import numpy as np
def      a_ (      _A      ,   _A      ,   _A      ,   _A      ,   _A  )			->			Optional[Any]:







				"""simple docstring"""
				snake_case__									=     int(np.ceil((x_end - xa) / h  )  )
				snake_case__									=     np.zeros((n + 1,)  )
				snake_case__									=     ya
				snake_case__									=     xa

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

				return y


if __name__ == "__main__":
							import doctest

							doctest.testmod()












def      a_ (      _A = 4000000  )			->			int:







				"""simple docstring"""
				snake_case__									=     [0, 1]
				snake_case__									=     0
				while fib[i] <= n:
								fib.append(fib[i] + fib[i + 1]  )
								if fib[i + 2] > n:
												break
								i += 1
				snake_case__									=     0
				for j in range(len(_A  ) - 1  ):
								if fib[j] % 2 == 0:
												total += fib[j]

				return total


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




