'''simple docstring'''




def __lowerCAmelCase					(				UpperCamelCase__							)      ->       bool:
    return str(UpperCamelCase__							) == str(UpperCamelCase__							)[::-1]






def __lowerCAmelCase					(				UpperCamelCase__							)      ->       int:
    return int(UpperCamelCase__							) + int(str(UpperCamelCase__							)[::-1]							)






def __lowerCAmelCase					(				UpperCamelCase__ = 1_00_00							)      ->       int:
    __lowerCamelCase            =    []
    for num in range(1							,    UpperCamelCase__							):
        __lowerCamelCase            =    0
        __lowerCamelCase            =    num
        while iterations < 50:
            __lowerCamelCase            =    sum_reverse(UpperCamelCase__							)
            iterations += 1
            if is_palindrome(UpperCamelCase__							):
                break
        else:
            lychrel_nums.append(UpperCamelCase__							)
    return len(UpperCamelCase__							)


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

'''simple docstring'''




def __lowerCAmelCase					(				UpperCamelCase__							,    UpperCamelCase__							)      ->       float:
    return base * power(UpperCamelCase__							,    (exponent - 1)							) if exponent else 1


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