


def   a						(				SCREAMING_SNAKE_CASE_   :		Dict				,      SCREAMING_SNAKE_CASE_   :		Dict							):






       """simple docstring"""





       if n == 0:
              return 1

       elif n % 2 == 1:
              return binary_exponentiation(__A				,      n - 1							) * a

       else:
              UpperCamelCase     :						int 						=		binary_exponentiation(__A				,      n / 2							)
              return b * b


if __name__ == "__main__":
  try:
    __UpperCAmelCase			:			Dict			      =					int(input("Enter Base : ").strip())
    __UpperCAmelCase			:			Dict			      =					int(input("Enter Power : ").strip())
  except ValueError:
    print("Invalid literal for integer")

  __UpperCAmelCase			:			Optional[Any]			      =					binary_exponentiation(BASE, POWER)
  print(f'''{BASE}^({POWER}) : {RESULT}''')


lowerCAmelCase      :				Union[str, Any]     			=1000







def     A__	(       __A						):







    '''simple docstring'''
    return x * x







def     A__	(       __A ,			__A ,			__A ,			__A = 4						):







    '''simple docstring'''
    assert callable(
        __A						), F"""the function(object) passed should be callable your input : {function}"""
    assert isinstance(__A ,			(float, int)						), F"""a should be float or integer your input : {a}"""
    assert isinstance(function(__A						) ,			(float, int)						), (
        "the function should return integer or float return type of your function, "
        F"""{type(__A						)}"""
    )
    assert isinstance(__A ,			(float, int)						), F"""b should be float or integer your input : {b}"""
    assert (
        isinstance(__A ,			__A						) and precision > 0
    ), F"""precision should be positive integer your input : {precision}"""

    # just applying the formula of simpson for approximate integration written in
    # mentioned article in first comment of this file and above this function

    _lowerCamelCase  :		Optional[Any]			    =    (b - a) / N_STEPS
    _lowerCamelCase  :		str			    =    function(__A						) + function(__A						)

    for i in range(1 ,			__A						):
        _lowerCamelCase  :		str			    =    a + h * i
        result += function(__A						) * (4 if i % 2 else 2)

    result *= h / 3
    return round(__A ,			__A						)


if __name__ == "__main__":
    import doctest

    doctest.testmod()




