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()
}

C++: #include<bits/stdc++.h>
using namespace std;
int main(){
        long long p,q;
        cin >> p >> q;
        for(long long i=2;i*i<=q;i++){
                if(p%i==0&&q%i==0){
                        do{
                                p/=i;
                                q/=i;
                        }
                        while(p%i==0&&q%i==0);
                }
        }
        for(long long i=2;i*i<=q;i++){
                if((float)pow(p,(float)1/i)-(int)pow(p,(float)1/i)==0&&(float)pow(q,(float)1/i)-(int)pow(q,(float)1/i)==0){
                	p/=(int)pow(p,(float)1/i);
                	q/=(int)pow(q,(float)1/i);
                }
        }
        cout << q << endl;
        return 0;
}

C++: #include<iostream>
#include<cstdio>
#include<algorithm>
#include<string>
#include<vector>
#include<queue>
#include<set>
#include<functional>
#include<map>
using namespace std;

int gcd(int a, int b) {
	if (b == 0)return a;
	return gcd(b, a%b);
}
int main() {
	int a, b; cin >> a >> b;
	b = b / gcd(a, b); a = b;
	int c = 1;
	for (int i = 2; i*i <= a; i++) {
		if (b%i == 0)c *= i;
		while (b%i == 0)b /= i;
	}
	if (b != 1)c *= b;
	cout << c << endl;
}

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

int gcd(int a, int b)
{
  return b == 0 ? a : gcd(b,a%b);
}

int main()
{
  long long int p, q;
  cin >> p >> q;
  q /= gcd(p,q);
  for(int i = 2; i < 32000; i++){
    double x = log(q) / log(i);
    if(ceil(x) == floor(x)){
      cout << i << endl;
      return 0;
    }
  }
  cout << q << endl;
}

C++: #include<iostream>
using namespace std;
int p, q; int gcd(int a, int b) { if (b == 0)return a; return gcd(b, a%b); }
int main() {
    cin >> p >> q; int res = 1; int r = gcd(p, q); q /= r;
    for (int i = 2; i*i <= q; i++) {
        if (q%i == 0) { res *= i; while (q%i == 0)q /= i; }
    }
    if (q >= 2)res *= q;
    cout << res << endl;
    return 0;
}

C++: 
#include <iostream>
#include <vector>
#include <cmath>

using namespace std;
typedef long long ll;
const ll INF = 1LL << 50;

int solve();

ll gcd(ll p, ll q) {
	if (q == 0) { return p; }
	return gcd(q, p%q);
}

int main(void) {
	while (solve()) {}
	return 0;
}

int solve() {

	ll p, q, g;

	cin >> p >> q;

	g = gcd(max(p, q), min(p, q));

	//	約分
	p = p / g;
	q = q / g;

	//	エラトステネスの篩

	const ll M = sqrt(10e10);
	std::vector< bool > isPrime(M, true);
	isPrime[1] = false;

	for (ll i = 2; i < M; i++) {
		if (isPrime[i] == false) { continue; }
		for (ll j = 2; i * j < M; j++) {
			isPrime[i*j] = false;
		}
	}

	ll ans = 1;
	
	for (ll i = 2; i < M; i++) {
		if (isPrime[i] == true && q % i == 0 ) {
			ans *= i;
		}
	}
	
	if( ans == 1 && q > 1 ) { ans = q; }
	
	cout << ans << endl;

	return 0;
}

C++: #include<iostream>
#include<algorithm>
#include<string>
#include<cmath>
#include<vector>
#include<functional>
#include<stack>

using namespace std;

long long solve(long long a, long long b) {
	long long x = max(a, b), y = min(a, b);
	if (x%y == 0)return y;
	else return solve(x%y, y);
}

int main() {
	long long p, q, r, ans;
	vector<long long> prime(100000);
	cin >> p >> q;
	r = solve(p, q);
	p /= r;
	q /= r;
	long long i = 2, j = 0, temp = q;
	while (temp != 1) {
		if (temp%i == 0) {
			temp /= i;
			prime[j]++;
		}
		else {
			if (i == 2)i = 3;
			else i += 2;
			if (prime[j] > 0)j++;
		}
	}
	sort(prime.begin(), prime.begin() + j);
	if (prime[0] == 1);
	else {
		long long k = 2;
		while (prime[0] != 1 && prime[0] >= k) {
			if (prime[0] % k == 0) {
				int all = 1;
				for (int l = 0; l < j; l++) {
					if (prime[l] % k != 0) {
						if (k == 2)k = 3;
						else k += 2;
						all = 0;
						break;
					}
				}
				if (all = 1) {
					double kk;
					kk = k;
					q = pow(q, 1 / kk);
					for (int l = 0; l <= j; l++)prime[l] /= k;
				}
			}
			else {
				if (k == 2)k = 3;
				else k += 2;
			}
		}
	}
	cout << q << endl;
	return 0;
}

C++: #include<iostream>
#include<algorithm>
using namespace std;
int COU(int a,int b){
	if(a==b||a==0)return 1;
	while(true){
		if(a<b){int t=a;a=b,b=t;}
		if(b==0)return a;
		a%=b;
	}
}
int main(){
	int p,q;
	cin>>p>>q;
	cout<<q/COU(p,q)<<endl;
	return 0;
}