
'''simple docstring'''
def      UpperCamelCase_				(      A__  ,      A__						):
	return base * power(A__  ,      (exponent - 1)						) if exponent else 1


if __name__ == "__main__":
		print('Raise base to the power of exponent using recursion...')
		lowercase__											=int(input('Enter the base: ').strip())
		lowercase__											=int(input('Enter the exponent: ').strip())
		lowercase__											=power(base, abs(exponent))
		if exponent < 0:  # power() does not properly deal w/ negative exponents
				lowercase__											=1 / result
		print(F"""{base} to the power of {exponent} is {result}""")


'''simple docstring'''
def      UpperCamelCase_				(      A__						):
	if len(A__						) <= 1:
		return lst

	a_      				=						1

	while i < len(A__						):
		if lst[i - 1] <= lst[i]:
			i += 1
		else:
			a_				,  a_      				=						lst[i], lst[i - 1]
			i -= 1
			if i == 0:
				a_      				=						1

	return lst


if __name__ == "__main__":
		lowercase__											=input('Enter numbers separated by a comma:\n').strip()
		lowercase__											=[int(item) for item in user_input.split(',')]
		print(gnome_sort(unsorted))
