Pow(x, n)

Given a number x and an integer n, compute x raised to the power n. This is the canonical fast exponentiation problem and the basis for many modular and number-theory optimizations.

Input Format

x = base, n = exponent

Output Format

x raised to n

Constraints

• -100.0 <= x <= 100.0; -2^31 <= n <= 2^31 - 1

Examples

x = 2
n = 10

1024.0

x = 2.1
n = 3

9.261000000000001