

from __future__ import annotations


def   __SCREAMING_SNAKE_CASE					(SCREAMING_SNAKE_CASE__  ,		SCREAMING_SNAKE_CASE__       ):
						# Checks if the entire collection has been sorted
						if len(SCREAMING_SNAKE_CASE__       ) <= 1 or n <= 1:
												return

						insert_next(SCREAMING_SNAKE_CASE__  ,		n - 1       )
						rec_insertion_sort(SCREAMING_SNAKE_CASE__  ,		n - 1       )


def   __SCREAMING_SNAKE_CASE					(SCREAMING_SNAKE_CASE__  ,		SCREAMING_SNAKE_CASE__       ):
						# Checks order between adjacent elements
						if index >= len(SCREAMING_SNAKE_CASE__       ) or collection[index - 1] <= collection[index]:
												return

						# Swaps adjacent elements since they are not in ascending order
						snake_case_,    snake_case_   =	(
						    collection[index],
						    collection[index - 1],
						)

						insert_next(SCREAMING_SNAKE_CASE__  ,		index + 1       )


if __name__ == "__main__":
					lowerCAmelCase_       	=	input('''Enter integers separated by spaces: ''')
					lowerCAmelCase_       	=	[int(num) for num in numbers.split()]
					rec_insertion_sort(number_list, len(number_list))
					print(number_list)


import math


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

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