Power of Cryptography

Given an integer n ≥ 1 and an integer p ≥ 1 you are to write a program that determines , the positive n-th root of p. There always exists such integer k that k^n^{ }= p.

Input

Consists of two numbers n and p (1 ≤ n ≤ 300, 1 ≤ p ≤ 10^100). It is known that there always exists an integer k (1 ≤ k ≤ 10^9) such that k^n = p.

Output

Print the value , i.e. the number k such that k^n = p.

Examples