






"""simple docstring"""

import math






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

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

from __future__ import annotations

lowercase    			=       []






def _lowerCAmelCase	(  __lowerCamelCase:list[list[int]] ,						__lowerCamelCase:int ,						__lowerCamelCase:int   ):

						'''simple docstring'''






						for i in range(len(__lowerCamelCase   )   ):
												if board[row][i] == 1:
																		return False
						for i in range(len(__lowerCamelCase   )   ):
												if board[i][column] == 1:
																		return False
						for i, j in zip(range(__lowerCamelCase ,						-1 ,						-1   ) ,						range(__lowerCamelCase ,						-1 ,						-1   )   ):
												if board[i][j] == 1:
																		return False
						for i, j in zip(range(__lowerCamelCase ,						-1 ,						-1   ) ,						range(__lowerCamelCase ,						len(__lowerCamelCase   )   )   ):
												if board[i][j] == 1:
																		return False
						return True






def _lowerCAmelCase	(  __lowerCamelCase:list[list[int]] ,						__lowerCamelCase:int   ):

						'''simple docstring'''






						if row >= len(__lowerCamelCase   ):
												solution.append(__lowerCamelCase   )
												printboard(__lowerCamelCase   )
												print()
												return True
						for i in range(len(__lowerCamelCase   )   ):
												if is_safe(__lowerCamelCase ,						__lowerCamelCase ,						__lowerCamelCase   ):
																		__magic_name__            =     1
																		solve(__lowerCamelCase ,						row + 1   )
																		__magic_name__            =     0
						return False






def _lowerCAmelCase	(  __lowerCamelCase:list[list[int]]   ):

						'''simple docstring'''






						for i in range(len(__lowerCamelCase   )   ):
												for j in range(len(__lowerCamelCase   )   ):
																		if board[i][j] == 1:
																								print("Q" ,						end=" "   )
																		else:
																								print("." ,						end=" "   )
												print()


# n=int(input("The no. of queens"))
lowercase    			=       8
lowercase    			=       [[0 for i in range(n)] for j in range(n)]
solve(board, 0)


print('''The total no. of solutions are :''', len(solution))



