






"""simple docstring"""
def 				snake_case      (   A__	,A__						):
			while second != 0:
						UpperCAmelCase_     : Optional[Any]			     =					first & second
						first ^= second
						UpperCAmelCase_     : Optional[int]			     =					c << 1
			return first


if __name__ == "__main__":
			import doctest

			doctest.testmod()

			lowerCamelCase_					=      int(input('''Enter the first number: ''').strip())
			lowerCamelCase_					=      int(input('''Enter the second number: ''').strip())
			print(f'{add(first, second) = }')











"""simple docstring"""
def 				snake_case      (   A__	,A__						):
			# "extended trapezoidal rule"
			# int(f) = dx/2 * (f1 + 2f2 + ... + fn)
			UpperCAmelCase_     : Dict			     =					(boundary[1] - boundary[0]) / steps
			UpperCAmelCase_     : Optional[int]			     =					boundary[0]
			UpperCAmelCase_     : str			     =					boundary[1]
			UpperCAmelCase_     : Tuple			     =					make_points(A__	,A__	,A__						)
			UpperCAmelCase_     : List[str]			     =					0.0
			y += (h / 2.0) * f(A__						)
			for i in x_i:
						# print(i)
						y += h * f(A__						)
			y += (h / 2.0) * f(A__						)
			return y

def 				snake_case      (   A__	,A__	,A__						):
			UpperCAmelCase_     : Union[str, Any]			     =					a + h
			while x < (b - h):
						yield x
						UpperCAmelCase_     : Optional[Any]			     =					x + h

def 				snake_case      (   A__						):  # enter your function here
			UpperCAmelCase_     : Dict			     =					(x - 0) * (x - 0)
			return y

def 				snake_case      (   ):
			UpperCAmelCase_     : Dict			     =					0.0  # Lower bound of integration
			UpperCAmelCase_     : Optional[int]			     =					1.0  # Upper bound of integration
			UpperCAmelCase_     : Dict			     =					10.0  # define number of steps or resolution
			UpperCAmelCase_     : List[Any]			     =					[a, b]  # define boundary of integration
			UpperCAmelCase_     : Union[str, Any]			     =					method_a(A__	,A__						)
			print(F"""y = {y}"""						)


if __name__ == "__main__":
			main()



