Problem:
Score : 300 points

Problem Statement

There are N integers a_1, a_2, ..., a_N not less than 1.
The values of a_1, a_2, ..., a_N are not known, but it is known that a_1 \times a_2 \times ... \times a_N = P.

Find the maximum possible greatest common divisor of a_1, a_2, ..., a_N.

Constraints

1 \leq N \leq 10^{12}

1 \leq P \leq 10^{12}

Input

Input is given from Standard Input in the following format:

N P

Output

Print the answer.

Sample Input 1

3 24

Sample Output 1

2

The greatest common divisor would be 2 when, for example, a_1=2, a_2=6 and a_3=2.

Sample Input 2

5 1

Sample Output 2

1

As a_i are positive integers, the only possible case is a_1 = a_2 = a_3 = a_4 = a_5 = 1.

Sample Input 3

1 111

Sample Output 3

111

Sample Input 4

4 972439611840

Sample Output 4

206

Solution in Java8 (OpenJDK 1.8.0) (judge verdict: Time Limit Exceeded)

import java.util.*;
public class Main {
	public static void main(String[] args){
		Scanner sc = new Scanner(System.in);
		long N = sc.nextLong();
		long P = sc.nextLong();

        /*
        - 素因数分解する
        - 2: 9つ
        - 3: 3つ
        - 5: 5つ
        ...
        この場合に、それぞれの数をNで割った商（切り捨て）をかけ合わせたものが答え？
        上の例だと N=4 の場合は、2* 2つ * 5*1つ
        */
        Map<Long, Long> map = new HashMap<>();
        long divisor = 2;
        while (divisor <= P) {
            if (P % divisor == 0) {
                if (map.containsKey(divisor)) {
                    long value = map.get(divisor);
                    map.put(divisor, (long)(value + 1));
                } else {
                    map.put(divisor, (long)1);
                }
                P /= divisor;
            } else {
                divisor++;
            }
        }

        long answer = 1;
        for(Map.Entry<Long, Long> e : map.entrySet()) {
            long count = e.getValue() / N;
            if (count != 0) {
                answer *= Math.pow(e.getKey(), count);
            }
        }
        
        System.out.println(answer);
	}
}