output_description: Print the answer.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N P
attempt: def prime_decomposition(n):
    i = 2
    table = []
    while i * i <= n:
      while n % i == 0:
        n /= i
        table.append(i)
      i += 1
    if n > 1:
      table.append(int(n))
    return table
  
  
  cnt=1
  gcd=1
  b,p=map(int,input().split())
  a=prime_decomposition(p)
  print(a)
  if b==1:
  
  if b>1:
    l=len(a)
    for i in range(l-1):
      if a[i+1]==a[i]:
        cnt+=1
        if cnt==b:
          gcd*=a[i]
          cnt=1
      else:
        cnt=1
    print(gcd)
  
problem_description: 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.
samples: [{"input": "3 24", "output": "2\n    \n\nThe greatest common divisor would be 2 when, for example, a_1=2, a_2=6 and\na_3=2.\n\n* * *"}, {"input": "5 1", "output": "1\n    \n\nAs a_i are positive integers, the only possible case is a_1 = a_2 = a_3 = a_4\n= a_5 = 1.\n\n* * *"}, {"input": "1 111", "output": "111\n    \n\n* * *"}, {"input": "4 972439611840", "output": "206"}]