(* O(√n) *)
let lowest_prime_factor n =
  let m = int_of_float (floor (sqrt (float_of_int n))) in
  let rec loop i =
    if i > m then
      n
    else
      if n mod i = 0 then i else loop (i + 1)
  in
    loop 2

(* O(√n * log(n)) *)
let factorize_primes n =
  if n <= 1 then
    []
  else
    let rec loop sofar (p, count) m =
      if m = 1 then
        List.tl (List.rev ((p, count) :: sofar))
      else
        let prime = lowest_prime_factor m in
        if p = prime then
          loop sofar (p, count + 1) (m / p)
        else
          loop ((p, count) :: sofar) (prime, 1) (m / prime)
    in
      loop [] (1, 0) n

let solve n p =
  if p = 1 then
    1
  else
    List.fold_left
      (fun sofar (p, count) ->
        let factor = int_of_float (float_of_int p ** float_of_int (count / n)) in
        sofar * factor)
      1
      (factorize_primes p)

let _ = Scanf.scanf "%d %d" (fun n p -> solve n p |> string_of_int |> print_endline)