

import math

def 		UpperCamelCase      (lowercase_:				Dict					,   lowercase_:				List[Any]      )  ->   Optional[int]:
	if 0 not in (x, y):
		# We use the relation x^y = y*log10(x), where 10 is the base.
		return y * math.logaa(lowercase_      )
	else:
		if x == 0:  # 0 raised to any number is 0
			return 0
		elif y == 0:
			return 1  # any number raised to 0 is 1
	raise AssertionError("""This should never happen"""      )


if __name__ == "__main__":  # Main function
	# Read two numbers from input and typecast them to int using map function.
	# Here x is the base and y is the power.
	A_ :				Optional[int]						 =    'Enter the base and the power separated by a comma: '
	A_ ,    A_ :				Dict						 =    map(int, input(prompt).split(','))
	A_ ,    A_ :				Optional[Any]						 =    map(int, input(prompt).split(','))

	# We find the log of each number, using the function res(), which takes two
	# arguments.
	A_ :				Any						 =    res(xa, ya)
	A_ :				str						 =    res(xa, ya)

	# We check for the largest number
	if resa > resa:
		print('Largest number is', xa, '^', ya)
	elif resa > resa:
		print('Largest number is', xa, '^', ya)
	else:
		print('Both are equal')






from typing import TYPE_CHECKING

from ...utils import OptionalDependencyNotAvailable, _LazyModule, is_sentencepiece_available


A_ :				Optional[Any]						 =    {}

try:
	if not is_sentencepiece_available():
		raise OptionalDependencyNotAvailable()
except OptionalDependencyNotAvailable:
	pass
else:
	A_ :				str						 =    ['BartphoTokenizer']

if TYPE_CHECKING:
	try:
		if not is_sentencepiece_available():
			raise OptionalDependencyNotAvailable()
	except OptionalDependencyNotAvailable:
		pass
	else:
		from .tokenization_bartpho import BartphoTokenizer

else:
	import sys

	A_ :				Optional[int]						 =    _LazyModule(__name__, globals()['__file__'], _import_structure, module_spec=__spec__)



