



def    lowerCamelCase_(lowerCamelCase_    ,   lowerCamelCase_    ,   lowerCamelCase_    ) ->       Optional[int]:
						if n == 0:
												return 1

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

						else:
												UpperCAmelCase         =     binary_exponentiation(lowerCamelCase_    ,   n / 2    ,   lowerCamelCase_    )
												return (b * b) % mod


# a prime number
__lowerCamelCase     :							str  							=  701

__lowerCamelCase     :							int  							=  1_000_000_000
__lowerCamelCase     :							List[str]  							=  10

# using binary exponentiation function, O(log(p)):
print((a / b) % p == (a * binary_exponentiation(b, p - 2, p)) % p)





print((a / b) % p == (a * b ** (p - 2)) % p)








from ..utils import DummyObject, requires_backends





class  __magic_name__   (							metaclass=A__						):
		lowercase      :       int          =['''note_seq''']






		def __init__(						self      :     List[Any]				,		*UpperCamelCase__      :     Tuple				,		**UpperCamelCase__      :     Dict      )				->					int:
								'''simple docstring'''







								requires_backends(self				,		["note_seq"]      )






		@classmethod
		def SCREAMING_SNAKE_CASE_			(						cls      :     List[str]				,		*UpperCamelCase__      :     Dict				,		**UpperCamelCase__      :     str      )				->					Optional[int]:
								'''simple docstring'''







								requires_backends(cls				,		["note_seq"]      )







		@classmethod
		def SCREAMING_SNAKE_CASE_			(						cls      :     List[Any]				,		*UpperCamelCase__      :     Optional[int]				,		**UpperCamelCase__      :     Optional[Any]      )				->					Optional[int]:
								'''simple docstring'''







								requires_backends(cls				,		["note_seq"]      )



