



'''simple docstring'''

def 						__UpperCamelCase				(							_lowercase,				_lowercase					) ->			Union[str, Any]:
	if b == 0:
		return 1
	if (b % 2) == 0:
		return actual_power(_lowercase,				int(b / 2					)					) * actual_power(_lowercase,				int(b / 2					)					)
	else:
		return a * actual_power(_lowercase,				int(b / 2					)					) * actual_power(_lowercase,				int(b / 2					)					)







def 						__UpperCamelCase				(							_lowercase,				_lowercase					) ->			float:
	if b < 0:
		return 1 / actual_power(_lowercase,				_lowercase					)
	return actual_power(_lowercase,				_lowercase					)


if __name__ == "__main__":
		print(power(-2, -3))





'''simple docstring'''

def 						__UpperCamelCase				(							_lowercase					) ->			bool:
	return str(_lowercase					) == str(_lowercase					)[::-1]







def 						__UpperCamelCase				(							_lowercase					) ->			int:
	return int(_lowercase					) + int(str(_lowercase					)[::-1]					)







def 						__UpperCamelCase				(							_lowercase = 1_0000					) ->			int:
	_lowercase					:       List[str]       =		[]
	for num in range(1,				_lowercase					):
		_lowercase					:       Tuple       =		0
		_lowercase					:       Tuple       =		num
		while iterations < 50:
			_lowercase					:       Union[str, Any]       =		sum_reverse(_lowercase					)
			iterations += 1
			if is_palindrome(_lowercase					):
				break
		else:
			lychrel_nums.append(_lowercase					)
	return len(_lowercase					)


if __name__ == "__main__":
		print(F'''{solution() = }''')
