'''simple docstring'''
import math







def  _UpperCamelCase (     _a	:	Tuple				,     _a	:	List[str]			):




    """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.
  a=  '''Enter the base and the power separated by a comma: '''
  a,			a=  map(int, input(prompt).split(''','''))
  a,			a=  map(int, input(prompt).split(''','''))

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




'''simple docstring'''
def  _UpperCamelCase (     _a	:	int			):




    """simple docstring"""



    if bit_count < 0:
        raise ValueError('The given input must be positive'			)

    # get the generated string sequence
    __UpperCamelCase	:	Dict		    =  gray_code_sequence_string(_a			)
    #
    # convert them to integers
    for i in range(len(_a			)			):
        __UpperCamelCase	:	int		    =  int(sequence[i]				,     2			)

    return sequence







def  _UpperCamelCase (     _a	:	int			):




    """simple docstring"""



    if bit_count == 0:
        return ["0"]

    if bit_count == 1:
        return ["0", "1"]

    __UpperCamelCase	:	Dict		    =  1 << bit_count  # defines the length of the sequence
    # 1<< n is equivalent to 2^n

    # recursive answer will generate answer for n-1 bits
    __UpperCamelCase	:	Tuple		    =  gray_code_sequence_string(bit_count - 1			)

    __UpperCamelCase	:	str		    =  []

    # append 0 to first half of the smaller sequence generated
    for i in range(seq_len // 2			):
        __UpperCamelCase	:	Optional[Any]		    =  '0' + smaller_sequence[i]
        sequence.append(_a			)

    # append 1 to second half ... start from the end of the list
    for i in reversed(range(seq_len // 2			)			):
        __UpperCamelCase	:	List[Any]		    =  '1' + smaller_sequence[i]
        sequence.append(_a			)

    return sequence


if __name__ == "__main__":
  import doctest

  doctest.testmod()



