#include <bits/stdc++.h>
using namespace std;
bool isPrime(unsigned long long n) {
  for (unsigned long long i = 2; i < n; ++i)
    if (n % i == 0) return false;
  return true;
}
int main(int, char**) {
  unsigned long long n, p;
  unsigned long long ans = 1;
  unsigned int a[] = {
      2,   3,   5,   7,   11,  13,  17,  19,  23,  29,  31,  37,  41,  43,  47,
      53,  59,  61,  67,  71,  73,  83,  89,  97,  101, 103, 107, 109, 113, 127,
      131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199,
      211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283,
      293, 307, 311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383,
      397, 401, 409, 419, 421, 431, 433, 439, 443, 449, 457, 461, 463, 467, 479,
      487, 491, 499, 503, 509, 521, 523, 541, 547, 557, 563, 569, 571, 577, 587,
      593, 599, 601, 607, 613, 617, 619, 631, 641, 643, 647, 653, 659, 661, 673,
      677, 683, 691, 701, 709, 719, 727, 733, 743, 751, 757, 761, 769, 773, 787,
      797, 809, 811, 821, 823, 827, 829, 839, 853, 857};
  std::cin >> n >> p;
  unsigned int i = 2;
  unsigned int k = 0;
  while (p >= i) {
    if (p % i == 0) {
      k++;
      if (k >= n) {
        ans *= i;
        k = 0;
      }
      p /= i;
    } else {
      k = 0;
      ++i;
      while (!isPrime(i)) {
        ++i;
      }
    }
  }
  cout << ans << endl;
  return 0;
}
