


def 							UpperCamelCase_( lowerCamelCase_				,					lowerCamelCase_				,					lowerCamelCase_					)       ->		List[str]:
    if n == 0:
        return 1

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

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


# a prime number
SCREAMING_SNAKE_CASE			: str				   =					701

SCREAMING_SNAKE_CASE			: Optional[int]				   =					1000000000
SCREAMING_SNAKE_CASE			: Optional[int]				   =					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)









'''simple docstring'''




def 						__lowerCamelCase			(	UpperCAmelCase_ = 10_00							)   ->int:
	return sum(e for e in range(3					,				UpperCAmelCase_							) if e % 3 == 0 or e % 5 == 0							)


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



