import Data.List
import qualified Data.Map as Map

scan :: Int -> Int -> Int
scan _ 1 = 1
scan 1 p = p
scan n p = Map.foldrWithKey f 1 (factors p) where
    f k a b = b * (k^(div a n))

factors :: Int -> Map.Map Int Int
factors = iter Map.empty primes where
    iter m (p:ps) n
        | p*p <= n = case logP p n of
            Just (e, x) -> iter (Map.insert p e m) ps x
            Nothing     -> iter m ps n
        | otherwise = m

logP :: Int -> Int -> Maybe (Int, Int)
logP p n = if mod n p == 0 then iter 0 n else Nothing where
        iter e x = case divMod x p of
            (1, 0) -> Just (e+1, 1)
            (q, 0) -> iter (e+1) q
            (_, _) -> Just (e, x)                

primes :: [Int]
primes = 2:(sieve [3,5..]) where
    sieve (x:xs) = x : sieve (filter (\y -> mod y x /=0) xs)

main :: IO() 
main = do
    line1 <- getLine
    let [stN, stP] = words line1
        n = read stN :: Int
        p = read stP :: Int
    let ans = scan n p
    print ans