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 (root n p) p) where
    f k a b = b * (k^(div a n))

factors :: Int -> Int -> Map.Map Int Int
factors l n = iter Map.empty (primesL l) where
    iter m [] = m
    iter m (p:ps) = case logP p n of
        Just e -> iter (Map.insert p e m) ps
        Nothing -> iter m ps

logP :: Int -> Int -> Maybe 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)
            (q, 0) -> iter (e+1) q
            (_, _) -> Just e                

root :: Int -> Int -> Int
root n p = iter 0 (10^(1 + div 12 n)) where
    iter s e
        | e - s == 1 = e
        | discriminant m n p = iter m e
        | otherwise = iter s m 
        where
            m = div (s+e) 2
            discriminant m n p = fromIntegral m ^ n < fromIntegral p

primesL :: Int -> [Int]
primesL n = 2:(sieve [3,5..n]) where
    sieve (x:xs)
        | root 2 n >= x = x : sieve (filter (\y -> mod y x /=0) xs)
        | otherwise    = x:xs
{- 
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