


'''simple docstring'''




from math import sqrt





def   _a		(lowercase__			:   int						)			->			bool:






     """simple docstring"""
     assert isinstance(lowercase__							,   lowercase__						) and (
         number >= 0
     ), "'number' must been an int and positive"

     __snake_case           =						True

     # 0 and 1 are none primes.
     if number <= 1:
          __snake_case           =						False

     for divisor in range(2							,   int(round(sqrt(lowercase__						)						)						) + 1						):
          # if 'number' divisible by 'divisor' then sets 'status'
          # of false and break up the loop.
          if number % divisor == 0:
               __snake_case           =						False
               break

    # precondition
     assert isinstance(lowercase__							,   lowercase__						), "'status' must been from type bool"

     return status





def   _a		(lowercase__			:   Optional[int]						)			->			int:






     """simple docstring"""
     assert isinstance(lowercase__							,   lowercase__						) and (n > 2), "'N' must been an int and > 2"

     # beginList: contains all natural numbers from 2 up to N
     __snake_case           =						list(range(2							,   n + 1						)						)

     __snake_case           =						[]  # this list will be returns.

     # actual sieve of erathostenes
     for i in range(len(lowercase__						)						):
          for j in range(i + 1							,   len(lowercase__						)						):
               if (begin_list[i] != 0) and (begin_list[j] % begin_list[i] == 0):
                    __snake_case           =						0

    # filters actual prime numbers.
     __snake_case           =						[x for x in begin_list if x != 0]

     # precondition
     assert isinstance(lowercase__							,   lowercase__						), "'ans' must been from type list"

     return ans





def   _a		(lowercase__			:   Dict						)			->			Optional[int]:






     """simple docstring"""
     assert isinstance(lowercase__							,   lowercase__						) and (n > 2), "'N' must been an int and > 2"

     __snake_case           =						[]

     # iterates over all numbers between 2 up to N+1
     # if a number is prime then appends to list 'ans'
     for number in range(2							,   n + 1						):
          if is_prime(lowercase__						):
               ans.append(lowercase__						)

    # precondition
     assert isinstance(lowercase__							,   lowercase__						), "'ans' must been from type list"

     return ans





def   _a		(lowercase__			:   Union[str, Any]						)			->			Tuple:






     """simple docstring"""
     assert isinstance(lowercase__							,   lowercase__						) and number >= 0, "'number' must been an int and >= 0"

     __snake_case           =						[]  # this list will be returns of the function.

     # potential prime number factors.

     __snake_case           =						2

     __snake_case           =						number

     if number == 0 or number == 1:
          ans.append(lowercase__						)

     # if 'number' not prime then builds the prime factorization of 'number'
     elif not is_prime(lowercase__						):
          while quotient != 1:
               if is_prime(lowercase__						) and (quotient % factor == 0):
                    ans.append(lowercase__						)
                    quotient /= factor
               else:
                    factor += 1

     else:
          ans.append(lowercase__						)

     # precondition
     assert isinstance(lowercase__							,   lowercase__						), "'ans' must been from type list"

     return ans





def   _a		(lowercase__			:   Union[str, Any]						)			->			Any:






     """simple docstring"""
     assert isinstance(lowercase__							,   lowercase__						) and (
         number >= 0
     ), "'number' bust been an int and >= 0"

     __snake_case           =						0

     # prime factorization of 'number'
     __snake_case           =						prime_factorization(lowercase__						)

     __snake_case           =						max(lowercase__						)

     # precondition
     assert isinstance(lowercase__							,   lowercase__						), "'ans' must been from type int"

     return ans





def   _a		(lowercase__			:   Optional[Any]						)			->			List[Any]:






     """simple docstring"""
     assert isinstance(lowercase__							,   lowercase__						) and (
         number >= 0
     ), "'number' bust been an int and >= 0"

     __snake_case           =						0

     # prime factorization of 'number'
     __snake_case           =						prime_factorization(lowercase__						)

     __snake_case           =						min(lowercase__						)

     # precondition
     assert isinstance(lowercase__							,   lowercase__						), "'ans' must been from type int"

     return ans





def   _a		(lowercase__			:   Tuple						)			->			Any:






     """simple docstring"""
     assert isinstance(lowercase__							,   lowercase__						), "'number' must been an int"
     assert isinstance(number % 2 == 0							,   lowercase__						), "compare bust been from type bool"

     return number % 2 == 0





def   _a		(lowercase__			:   Optional[int]						)			->			Optional[Any]:






     """simple docstring"""
     assert isinstance(lowercase__							,   lowercase__						), "'number' must been an int"
     assert isinstance(number % 2 != 0							,   lowercase__						), "compare bust been from type bool"

     return number % 2 != 0





def   _a		(lowercase__			:   Optional[Any]						)			->			List[Any]:






     """simple docstring"""
     assert (
         isinstance(lowercase__							,   lowercase__						) and (number > 2) and is_even(lowercase__						)
     ), "'number' must been an int, even and > 2"

     __snake_case           =						[]  # this list will returned

     # creates a list of prime numbers between 2 up to 'number'
     __snake_case           =						get_prime_numbers(lowercase__						)
     __snake_case           =						len(lowercase__						)

     # run variable for while-loops.
     __snake_case           =						0
     __snake_case           =						None

     # exit variable. for break up the loops
     __snake_case           =						True

     while i < len_pn and loop:
          __snake_case           =						i + 1

          while j < len_pn and loop:
               if prime_numbers[i] + prime_numbers[j] == number:
                    __snake_case           =						False
                    ans.append(prime_numbers[i]						)
                    ans.append(prime_numbers[j]						)

               j += 1

          i += 1

     # precondition
     assert (
         isinstance(lowercase__							,   lowercase__						)
         and (len(lowercase__						) == 2)
         and (ans[0] + ans[1] == number)
         and is_prime(ans[0]						)
         and is_prime(ans[1]						)
     ), "'ans' must contains two primes. And sum of elements must been eq 'number'"

     return ans





def   _a		(lowercase__			:   Optional[int]							,   lowercase__			:   List[str]						)			->			Union[str, Any]:






     """simple docstring"""
     assert (
         isinstance(lowercase__							,   lowercase__						)
         and isinstance(lowercase__							,   lowercase__						)
         and (numbera >= 0)
         and (numbera >= 0)
     ), "'number1' and 'number2' must been positive integer."

     __snake_case           =						0

     while numbera != 0:
          __snake_case           =						numbera % numbera
          __snake_case           =						numbera
          __snake_case           =						rest

     # precondition
     assert isinstance(lowercase__							,   lowercase__						) and (
         numbera >= 0
     ), "'number' must been from type int and positive"

     return numbera





def   _a		(lowercase__			:   List[str]							,   lowercase__			:   Optional[int]						)			->			int:






     """simple docstring"""
     assert (
         isinstance(lowercase__							,   lowercase__						)
         and isinstance(lowercase__							,   lowercase__						)
         and (numbera >= 1)
         and (numbera >= 1)
     ), "'number1' and 'number2' must been positive integer."

     __snake_case           =						1  # actual answer that will be return.

     # for kgV (x,1)
     if numbera > 1 and numbera > 1:
          # builds the prime factorization of 'number1' and 'number2'
          __snake_case           =						prime_factorization(lowercase__						)
          __snake_case           =						prime_factorization(lowercase__						)

     elif numbera == 1 or numbera == 1:
          __snake_case           =						[]
          __snake_case           =						[]
          __snake_case           =						max(lowercase__							,   lowercase__						)

     __snake_case           =						0
     __snake_case           =						0

     __snake_case           =						[]  # captured numbers int both 'primeFac1' and 'primeFac2'

     # iterates through primeFac1
     for n in prime_fac_a:
          if n not in done:
               if n in prime_fac_a:
                    __snake_case           =						prime_fac_a.count(lowercase__						)
                    __snake_case           =						prime_fac_a.count(lowercase__						)

                    for _ in range(max(lowercase__							,   lowercase__						)						):
                         ans *= n

               else:
                    __snake_case           =						prime_fac_a.count(lowercase__						)

                    for _ in range(lowercase__						):
                         ans *= n

               done.append(lowercase__						)

    # iterates through primeFac2
     for n in prime_fac_a:
          if n not in done:
               __snake_case           =						prime_fac_a.count(lowercase__						)

               for _ in range(lowercase__						):
                    ans *= n

               done.append(lowercase__						)

    # precondition
     assert isinstance(lowercase__							,   lowercase__						) and (
         ans >= 0
     ), "'ans' must been from type int and positive"

     return ans





def   _a		(lowercase__			:   Optional[int]						)			->			Optional[int]:






     """simple docstring"""
     assert isinstance(lowercase__							,   lowercase__						) and (n >= 0), "'number' must been a positive int"

     __snake_case           =						0
     __snake_case           =						2  # this variable holds the answer

     while index < n:
          index += 1

          ans += 1  # counts to the next number

          # if ans not prime then
          # runs to the next prime number.
          while not is_prime(lowercase__						):
               ans += 1

    # precondition
     assert isinstance(lowercase__							,   lowercase__						) and is_prime(
         lowercase__						), "'ans' must been a prime number and from type int"

     return ans





def   _a		(lowercase__			:   List[str]							,   lowercase__			:   List[Any]						)			->			List[Any]:






     """simple docstring"""
     assert (
         is_prime(lowercase__						) and is_prime(lowercase__						) and (p_number_a < p_number_a)
     ), "The arguments must been prime numbers and 'pNumber1' < 'pNumber2'"

     __snake_case           =						p_number_a + 1  # jump to the next number

     __snake_case           =						[]  # this list will be returns.

     # if number is not prime then
     # fetch the next prime number.
     while not is_prime(lowercase__						):
          number += 1

     while number < p_number_a:
          ans.append(lowercase__						)

          number += 1

          # fetch the next prime number.
          while not is_prime(lowercase__						):
               number += 1

    # precondition
     assert (
         isinstance(lowercase__							,   lowercase__						)
         and ans[0] != p_number_a
         and ans[len(lowercase__						) - 1] != p_number_a
     ), "'ans' must been a list without the arguments"

     # 'ans' contains not 'pNumber1' and 'pNumber2' !
     return ans





def   _a		(lowercase__			:   int						)			->			Dict:






     """simple docstring"""
     assert isinstance(lowercase__							,   lowercase__						) and (n >= 1), "'n' must been int and >= 1"

     __snake_case           =						[]  # will be returned.

     for divisor in range(1							,   n + 1						):
          if n % divisor == 0:
               ans.append(lowercase__						)

    # precondition
     assert ans[0] == 1 and ans[len(lowercase__						) - 1] == n, "Error in function getDivisiors(...)"

     return ans





def   _a		(lowercase__			:   List[Any]						)			->			str:






     """simple docstring"""
     assert isinstance(lowercase__							,   lowercase__						) and (
         number > 1
     ), "'number' must been an int and >= 1"

     __snake_case           =						get_divisors(lowercase__						)

     # precondition
     assert (
         isinstance(lowercase__							,   lowercase__						)
         and (divisors[0] == 1)
         and (divisors[len(lowercase__						) - 1] == number)
     ), "Error in help-function getDivisiors(...)"

     # summed all divisors up to 'number' (exclusive), hence [:-1]
     return sum(divisors[:-1]						) == number





def   _a		(lowercase__			:   List[Any]							,   lowercase__			:   Tuple						)			->			Tuple:






     """simple docstring"""
     assert (
         isinstance(lowercase__							,   lowercase__						)
         and isinstance(lowercase__							,   lowercase__						)
         and (denominator != 0)
     ), "The arguments must been from type int and 'denominator' != 0"

     # build the greatest common divisor of numerator and denominator.
     __snake_case           =						gcd(abs(lowercase__						)							,   abs(lowercase__						)						)

     # precondition
     assert (
         isinstance(lowercase__							,   lowercase__						)
         and (numerator % gcd_of_fraction == 0)
         and (denominator % gcd_of_fraction == 0)
     ), "Error in function gcd(...,...)"

     return (numerator // gcd_of_fraction, denominator // gcd_of_fraction)





def   _a		(lowercase__			:   Optional[int]						)			->			Union[str, Any]:






     """simple docstring"""
     assert isinstance(lowercase__							,   lowercase__						) and (n >= 0), "'n' must been a int and >= 0"

     __snake_case           =						1  # this will be return.

     for factor in range(1							,   n + 1						):
          ans *= factor

     return ans





def   _a		(lowercase__			:   str						)			->			List[Any]:






     """simple docstring"""
     assert isinstance(lowercase__							,   lowercase__						) and (n >= 0), "'n' must been an int and >= 0"

     __snake_case           =						0
     __snake_case           =						1
     __snake_case           =						1  # this will be return

     for _ in range(n - 1						):
          __snake_case           =						ans
          ans += fiba
          __snake_case           =						tmp

     return ans












"""simple docstring"""


import math


def        UpperCAmelCase      (					a__     ,      a__ ):





						'''simple docstring'''






						if 0 not in (x, y):
												# We use the relation x^y = y*log10(x), where 10 is the base.
												return y * math.logaa(a__ )
						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.
		__SCREAMING_SNAKE_CASE   =   'Enter the base and the power separated by a comma: '
		__SCREAMING_SNAKE_CASE,						__SCREAMING_SNAKE_CASE   =   map(int, input(prompt).split(','))
		__SCREAMING_SNAKE_CASE,						__SCREAMING_SNAKE_CASE   =   map(int, input(prompt).split(','))

		# We find the log of each number, using the function res(), which takes two
		# arguments.
		__SCREAMING_SNAKE_CASE   =   res(xa, ya)
		__SCREAMING_SNAKE_CASE   =   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')