Calculate power of a number (xⁿ) using recursion.

Difficulty: Medium

Phase: 3 · Recursion

XP Reward: 20 XP

Topics: Recursion, Medium

Supported Languages: Python, JavaScript, C, C++, Java

Problem Description

Given base X and exponent N (non-negative) on separate lines, compute X^N recursively. Input Format: Read input from standard input (stdin). Output Format: Print the result to standard output (stdout).

Constraints

-10^9 <= N <= 10^9

Examples

Example 1

Input: 2 5

Output: 32

Explanation: Sample execution for input 2 5