using System;
using System.Collections.Generic;
using System.Linq;
using static Atcoder;
using System.Threading.Tasks;
using System.ComponentModel;

public class Hello
{
    public static void Main()
    {
        long[] NP = LSRead();
        long N = NP[0], P = NP[1];
        if (P == 1) { Console.WriteLine(1); return; }
        if (N == 1) { Console.WriteLine(P); return; }
        var fac = new Factorization(P);
        var box = fac.Calc();
        Dictionary<long, long> dic = new Dictionary<long, long>();
        foreach (var l in box)
        {
            if (!dic.ContainsKey(l)) dic[l] = 1;
            else dic[l]++;
        }
        var sorted = dic.OrderByDescending(v => v.Key);
        long ans = 1;
        foreach (var v in sorted)
        {
            if (v.Value >= N)
            {
                ans *= (long)Math.Pow(v.Key, v.Value / N);
            }
        }
        Console.WriteLine(ans);
    }
}

public class Factorization
{
    private static long N;

    public Factorization(long n) { N = n; }

    //最大公約数を返す
    public static long GCD(long a, long b)
    {
        if (a < b) return GCD(b, a);
        long r;
        while (b != 0)
        {
            r = a % b;
            a = b;
            b = r;
        }
        return a;
    }

    //素数判定
    public static bool IsPrime(long n)
    {
        if (n < 2) return false;
        if (n == 2) return true;
        if (n % 2 == 0) return false;

        double root = Math.Sqrt(n);
        for (int i = 3; i <= root; i += 2)
        {
            if (n % i == 0) return false;
        }
        return true;
    }

    //試し割り
    private static int[] TryPrimes = new int[] { 2, 3, 5, 7, 11 };
    public long TryAllocation(long p)
    {
        long count = 0;
        while (N % p == 0)
        {
            count++;
            N /= p;
        }
        return count;
    }

    private int[] xi = new int[] { 13, 17, 19, 23, 29 };
    private long f(long x, int suffix)
    {
        return (xi[suffix % xi.Count()] * x + suffix) % N;
    }

    //nを分解
    public long PollardsRho(long n, int suffix = 0)
    {
        //素数を渡すと失敗するらしい
        if (IsPrime(n)) return n; //もう素数
        long x = 2, y = 2, d = 1;
        while (d == 1)
        {
            x = f(x, suffix);
            y = f(f(y, suffix), suffix);
            d = GCD(Math.Abs(x - y), n);
        }
        if (d == n)
        {
            //f(x)を変えて試す
            return PollardsRho(n, suffix + 1);
        }
        return d;
    }

    public IEnumerable<long> Calc()
    {
        //小さな素因数の計算
        foreach (var prime in TryPrimes)
        {
            var box = TryAllocation(prime);
            for (int i = 0; i < box; i++) yield return prime;
        }

        //残りをRhoで解く
        while (true)
        {
            if (N == 1) break;
            var ret = PollardsRho(N);
            yield return ret;
            N /= ret;
        }
    }
}

public class Atcoder
{
    static void Swap<T>(ref T a, ref T b)
    {
        var t = a;
        a = b;
        b = t;
    }
    public static int LCM(int a, int b)
    {
        int c = a * b;
        if (a < b) Swap(ref a, ref b);
        int d = a % b;
        while (d != 0)
        {
            a = b;
            b = d;
            d = a % b;
        }
        return c / b;
    }
    public static string StrReverce(string s)
    {
        return new string(s.Reverse().ToArray());
    }
    public static int intRead()
    {
        return int.Parse(Console.ReadLine());
    }
    public static bool IsPrime(int n)
    {
        if (n < 2) return false;
        if (n == 2) return true;
        if (n % 2 == 0) return false;

        //double sqrtNum = Math.Sqrt(n);
        for (int i = 3; i < n; i += 2)
        {
            if (n % i == 0) return false;
        }
        return true;
    }
    public static string[] SpRead(char c)
    {
        return Console.ReadLine().Split(c);
    }
    public static long[] LSRead()
    {
        return Console.ReadLine().Split(' ').Select(long.Parse).ToArray();
    }
}


Measured memory_bytes: 13524