using System;
using System.Collections.Generic;
using System.Linq;

namespace C
{
	class C
	{
		static void Main(string[] args)
		{
			string[] inputs = Console.ReadLine().Split(' ');
			ulong N = ulong.Parse(inputs[0]);
			ulong P = ulong.Parse(inputs[1]);

			Dictionary<ulong, ulong> prime = new Dictionary<ulong, ulong>();
			ulong p = P;
			int x;
			if(p == 1) {
				Console.WriteLine(1);
				return;
			}
			if(N == 1) {
				Console.WriteLine(P);
				return;
			}
			List<ulong> pnum = new List<ulong>();
			for(ulong i=2; i<Math.Sqrt(P); i++) {
				if(IsPrime(i)) pnum.Add(i);
			}

			for(x=0; x<pnum.Count/*p>=pnum[x]*/; x++) {
				for(ulong i=0; (p%pnum[x])==0; i++) {
					if(prime.ContainsKey(pnum[x]))
						prime[pnum[x]]++;
					else prime.Add(pnum[x], 1);
					p /= pnum[x];
				}
			}
			
			var C = prime.Where(n => n.Value >= N).Select(n => n.Key).ToList();
			if(C.Count == 0) {
				Console.WriteLine(1);
				return;
			}
			Console.WriteLine(C.Aggregate((now, next) => now * next));
		}

		public static bool IsPrime(ulong num)
		{
			if(num < 2) return false;
			else if(num == 2) return true;
			else if(num % 2 == 0) return false;

			double sqrtNum = Math.Sqrt(num);
			for(ulong i = 3; i <= sqrtNum; i += 2) {
				if(num % i == 0) {
					return false;
				}
			}
			return true;
		}
	}
}
