Go: package main

import (
	"bufio"
	"fmt"
	"io"
	"math"
	"os"
	"strconv"
	"strings"
)

func main() {
	fmt.Println(resolve(parseProblem(os.Stdin)))
}

func parseProblem(r io.Reader) int {
	const (
		initialBufSize = 100000
		maxBufSize     = 1000000
	)
	buf := make([]byte, initialBufSize)

	sc := bufio.NewScanner(r)
	sc.Buffer(buf, maxBufSize)
	sc.Split(bufio.ScanWords) // bufio.ScanLines
	p, q := scanInt(sc), scanInt(sc)
	base := 1
	d := newRational(p, q).denomi
	for k := range primeFactories(d) {
		base *= k
	}
	return base
}

func isPrime(n int) bool {
	for i := 2; i*i <= n; i++ {
		if n%i == 0 {
			return false
		}
	}
	return true
}

func eratosthenes(n int) []bool {
	t := make([]bool, n)
	for i := 2; i < len(t); i++ {
		t[i] = true
	}
	for i := 2; i < len(t); i++ {
		if !t[i] {
			continue
		}
		for j := 2; j*i < len(t); j++ {
			t[j*i] = false
		}
	}
	return t
}

func primes(n int) chan int {
	ch := make(chan int)
	go func() {
		t := eratosthenes(n)
		for i := 2; i < len(t); i++ {
			if !t[i] {
				continue
			}
			ch <- i
		}
		close(ch)
	}()
	return ch
}

func primeFactories(n int) (terms map[int]int) {
	terms = map[int]int{}
	num := n
	for f := 2; f*f <= n; f++ {
		if num%f != 0 {
			continue
		}
		ex := 0
		for num%f == 0 {
			num /= f
			ex++
		}
		terms[f] = ex
	}
	if num > 1 {
		terms[num] = 1
	}
	return
}

type rational struct {
	frac, denomi int
	neg          int
}

func newRational(frac, denomi int) rational {
	r := rational{frac: frac, denomi: denomi}
	r.canonicalize()
	return r
}

func ratMul(x, y rational) rational {
	r := rational{
		frac:   x.frac * y.frac,
		denomi: x.denomi * y.denomi,
	}
	r.canonicalize()
	return r
}

func ratDiv(x, y rational) rational {
	return ratMul(x, ratInv(y))
}

func ratInv(x rational) rational {
	return rational{frac: x.denomi, denomi: x.frac}
}

func ratAdd(x, y rational) rational {
	r := rational{
		frac:   x.frac*y.denomi + y.frac*x.denomi,
		denomi: x.denomi * y.denomi,
	}
	r.canonicalize()
	return r
}

func ratSub(x, y rational) rational {
	return ratAdd(x, rational{frac: -y.frac, denomi: y.denomi})
}

func (r rational) Float64() float64 {
	b := float64(r.frac) / float64(r.denomi)
	if r.neg == 1 {
		return -b
	}
	return b
}

func (r rational) String() string {
	b := fmt.Sprintf("%d/%d", r.frac, r.denomi)
	if r.neg == 1 {
		return "-" + b
	}
	return b
}

func (r rational) equal(other rational) bool {
	r.canonicalize()
	other.canonicalize()

	return r.neg == other.neg &&
		r.frac == other.frac &&
		r.denomi == other.denomi
}

func (r *rational) canonicalize() {
	if r.frac < 0 {
		r.neg ^= 1
		r.frac = -r.frac
	}
	if r.denomi < 0 {
		r.neg ^= 1
		r.denomi = -r.denomi
	}
	d := gcd(r.frac, r.denomi)
	r.frac /= d
	r.denomi /= d
}

func nextRational(sc *bufio.Scanner) rational {
	s := nextString(sc)
	i := strings.Index(s, ".")
	if i != -1 {
		decimalDigit := len(s) - i - 1
		fr, _ := strconv.Atoi(strings.Replace(s, ".", "", 1))
		return newRational(fr, int(math.Pow10(decimalDigit)))
	}
	i = strings.Index(s, "/")
	if i != -1 {
		fr, _ := strconv.Atoi(s[0:i])
		de, _ := strconv.Atoi(s[i+1 : len(s)])
		return newRational(fr, de)
	}
	fr, _ := strconv.Atoi(s)
	return newRational(fr, 1)
}
func gcd(a, b int) int {
	for b > 0 {
		t := a / b
		a, b = b, a-t*b
	}
	return a
}
func nextInt(sc *bufio.Scanner) int {
	sc.Scan()
	a, _ := strconv.Atoi(sc.Text())
	return int(a)
}

func nextString(sc *bufio.Scanner) string {
	sc.Scan()
	return sc.Text()
}

func resolve(n int) int {
	return n
}

// snip-scan-funcs
func scanInt(sc *bufio.Scanner) int {
	sc.Scan()
	i, _ := strconv.Atoi(sc.Text())
	return int(i)
}
func scanString(sc *bufio.Scanner) string {
	sc.Scan()
	return sc.Text()
}

Python: from fractions import gcd
from math import sqrt

if __name__ == "__main__":
    p, q = map(int, input().split())
    ans = q / gcd(p, q)
    while True:
        if sqrt(ans).is_integer():
            ans = int(sqrt(ans))
        else:
            print(ans)
            break

Python: # -*- coding: utf-8 -*-
import math
p, q = map(int, input().split())
g = math.gcd(p, q)
p, q = p // g, q // g;
ret = q
for b in range(1, 40000):
    if b ** 1000 * p % q == 0:
        ret = min(ret, b)
print(ret)

Python: # -*- coding: utf-8 -*-
import math
p, q = map(int, input().split())
g = math.gcd(p, q)
p, q = p // g, q // g;
ret = q
for b in range(1, 40000):
    if b ** 1000 * p % q == 0:
        ret = min(ret, b)
print(ret)

Python: import math

p = int(input())
q = int(input())

print(int(q/(math.gcd(p,q))))

Python: import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools

sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**10
mod = 998244353

def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
def pf(s): return print(s, flush=True)


def main():
    rr = []

    while True:
        p,q = LI()
        g = fractions.gcd(p,q)
        t = q//g
        k = 1
        while t % 4 == 0:
            k *= 2
            t //= 4
        for i in range(3,int(math.sqrt(t))+2,2):
            ii = i**2
            while t % ii == 0:
                k *= i
                t //= ii
        rr.append(t*k)

        break



    return '\n'.join(map(str, rr))


print(main())

Python: import math

p = int(input())
q = int(input())

print(b/(math.gcd(p,q)))

Python: def gcd(a,b):
    while b:a,b=b,a%b
    return a

if __name__=="__main__":
    a,b=map(int,input().split())
    b//=gcd(a,b)
    a,c=2,1
    while a**2<=b:
        if b%a==0:
            c*=a
            while b%a==0: b//=a
        a+=1
    print(c if b==1 else c*b)

Python: import math
p, q = map(int, input().split())
g = math.gcd(p, q)
p //= g
q //= g
ret = q
for b in range(1, 40000):
    if b ** 1000 * p % q == 0:
        ret = min(ret, b)
print(ret)

Python: prime = [2]
def check(x):
    for i in prime:
        if x % i ==0:
            return False
        elif x < i * i:
            break
    return True

def set():
    for i in range(3,10**5,2):
        if check(i):
            prime.append(i)


set()
#print(prime)
p,q = [int(i) for i in input().split(' ')]

for i in prime:
    while True:
        if p % i ==0 and q % i == 0:
            p = p//i
            q = q//i
        else:
            break

print(q)

C++: #include <iostream>
using namespace std;

// a>b
int gcd(int a, int b)
{
	if (b == 0) return a;
	return gcd(b, a%b);
}

int main()
{
	int p, q;
	cin >> p >> q;
	
	q /= gcd(p, q);
	int ans = 1;
	for (int i = 2; i*i <= q; i++) {
		if (q%i == 0) {
			ans *= i;
			while (q%i == 0) q /= i;
		}
	}

	cout << ans*q << endl;;
    return 0;
}

C++: #include <iostream>
#include <map>
using namespace std;

int euclid(int x, int y){
	int t;
	while (x % y){
		x %= y;
		t = x;
		x = y;
		y = t;
	}
	return y;
}
int main(){
	int p, q, n, m, t = 2, ans = 1;
	cin >> p >> q;
	n = q / euclid(p, q);
	m = n;
	map<int, int> f;
	while (n > 1){
		if (! (n % t)){
			n /= t;
			f[t] = 1;
		}
		while (! (n % t)){
			++f[t];
			n /= t;
		}
		++t;
	}
	m = q;
	for (auto itr = f.begin(); itr != f.end(); ++itr) m = min(m, itr->second);	
	for (auto itr = f.begin(); itr != f.end(); ++itr){
		m = euclid(m, itr->second);
	}
	for (auto itr = f.begin(); itr != f.end(); ++itr){
		for (int i = 0; i < itr->second/m; ++i){
			ans *= itr->first;
		}
	}
	cout << ans << endl;
	return 0;
}