1.

/**
* FWP, Ausgewählte Probleme aus dem ACM Programming Contest, WS09
* Problem: 113 Power of Chryptography
* Link: http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=23&page=show_problem&problem=2113
*
* @author Bernd Mayer
* @version 1.0, 10/21/2009
*
* Method : Ad-Hoc
* Status : Accepted
* Runtime: 1.6
*/

import java.util.Scanner;


public class Main {
public static void main(String ...srgs)
{
Scanner sc = new Scanner(System.in);
while (sc.hasNextDouble())
{
double n = sc.nextDouble();
double p = sc.nextDouble();
System.out.println((int)Math.round(Math.pow(p,1/n)));
}

}

}