Power Calculation

Background

Congcong is learning about exponentiation in mathematics. He wants to write a program to calculate the power of a number, but he is required to use recursion only, without using loops.

Problem Description

Given two positive integers $base$ and $n$, both of which are $1$ or more. Compute recursively (no loops) the value of $base$ to the $n$-th power. For example, $powerN(3, 2)$ is $9$ ($3$ squared).

Input Format

Input is given from Standard Input in the following format.

$base$ $n$

Output Format

Output is printed to Standard Output in the following format.

The calculated result of $base^n$

Sample

3 1

3

3 2

9

3 3

27

Sample Explanation

For the first sample, input $3$ $1$ means calculating $3^1$, and the result is $3$. For the second sample, input $3$ $2$ means calculating $3^2$, and the result is $9$. For the third sample, input $3$ $3$ means calculating $3^3$, and the result is $27$.

Constraints

For all test cases:

• $1 \le base \le 100$
• $1 \le n \le 15$
• Time limit: $1$ second
• Memory limit: $1024$ MiB