






def 			_SCREAMING_SNAKE_CASE						( )						->      List[str]:





    """simple docstring"""

    __A         =	[]
    __A         =	1

    while len(__lowercase    ) < 1E6:
        constant.append(str(__lowercase    )    )
        i += 1

    __A         =	"""""".join(__lowercase    )

    return (
        int(constant[0]    )
        * int(constant[9]    )
        * int(constant[9_9]    )
        * int(constant[9_9_9]    )
        * int(constant[9_9_9_9]    )
        * int(constant[9_9_9_9_9]    )
        * int(constant[9_9_9_9_9_9]    )
    )


if __name__ == "__main__":
  print(solution())












def 			_SCREAMING_SNAKE_CASE						( __lowercase   :			List[Any]			,				__lowercase   :			Dict			,				__lowercase   :			str    )						->      Dict:





    """simple docstring"""

    if n == 0:
        return 1

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

    else:
        __A         =	binary_exponentiation(__lowercase			,				n / 2			,				__lowercase    )
        return (b * b) % mod


# a prime number
__a      :       Union[str, Any]				  =   701

__a      :       Dict				  =   1000000000
__a      :       Union[str, Any]				  =   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)




