Competitions

# Functions

# 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**) such that

^{9}**k**=

^{n}**p**.

** Output**

Print the value , i.e. the number **k** such that **k ^{n}** =

**p**.

Input example #1

2 16

Output example #1

4

Input example #2

3 27

Output example #2

3

Input example #3

7 4357186184021382204544

Output example #3

1234