


"""simple docstring"""





def      _snake_case						(						_snake_case				:			str ,   _snake_case				:			str			):
      lowerCAmelCase					:	int       =   len(_snake_case			)
      lowerCAmelCase					:	int       =   len(_snake_case			)
      lowerCAmelCase					:	int       =   (
          first_str_length if first_str_length > second_str_length else second_str_length
      )
      lowerCAmelCase					:	list       =   []
      for char_count in range(_snake_case			):
            if char_count < first_str_length:
                  output_list.append(first_str[char_count]			)
            if char_count < second_str_length:
                  output_list.append(second_str[char_count]			)
      return "".join(_snake_case			)


if __name__ == "__main__":
 print(alternative_string_arrange('''AB''', '''XYZ'''), end=''' ''')






"""simple docstring"""





def      _snake_case						(						_snake_case				:			int ,   _snake_case				:			int			):
      return base * power(_snake_case ,   (exponent - 1)			) if exponent else 1


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


