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 <iostream>
using namespace std;
int p,q,count,ans,k;
int prime[100000];
char a[1000005];

int gcd(int b,int a){
	int c=1;
	while(1){
		c=a%b;
		a=b;
		b=c;
		if(c==0)break;
	}
	return a;
}

void check(){
	 count=0;
	for(int i=2;i<1000005;i++){
		if(a[i]=='1')continue;
		prime[count]=i;
		count++;
		for(int j=i;j<1000005;j+=i){
			a[j]='1';
		}
	}
}

int main(){
	for(int i=2;i<1000005;i++){
		a[i]='0';	
	}
	check();
	cin>> p>>q;
	q=q/gcd(p,q);
	ans=1;
	k=0;
	
	while(q>1){
		if(q%prime[k]==0)ans*=prime[k];
		while(q%prime[k]==0)q/=prime[k];
		k++;
	}
	cout<< ans<<endl;
}

C++: #include<bits/stdc++.h>
using namespace std;

int GCD(int a, int b){
	if(b == 0) return a;
	else return GCD(b, a % b);
}

int main(){
	int p, q;
	cin >> p >> q;
	cout << q / GCD(p, q) << endl;
	return 0;
}

C++: #include<iostream>
#include<cstdio>
#include<string>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
using namespace std;
typedef long long ll;
const ll MOD = 1000000007;
const ll INF = (ll)1000000007 * 1000000007;
const double EPS = 1e-9;
typedef pair<int, int> P;
typedef unsigned int ui;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
int gcd(int a, int b) {
	if (b == 0)return a;
	return gcd(b, a%b);
}
int main() {
	int isp[100000] = {};
	vector<int> v;
	Rep(i, 2, 100000) {
		if (!isp[i]) {
			v.push_back(i);
			for(int j=2*i;j<100000;j+=i){
				isp[j] = 1;
			}
		}
	}
	int p, q; cin >> p >> q;
	int d = gcd(q,p);
	q /= d;
	int out = 1; int now = 0;
	while (q > 1) {
		if (q%v[now] == 0) {
			out*=v[now];
			while (q%v[now] == 0)q /= v[now];
		}
		else if (v[now] > (int)sqrt(q + 0.5)) {
			out *= q; q = 1;
		}
		else now++;
	}
	if (out == 1)out = 2;
	cout << out << endl;
	return 0;
}

C++: #include <bits/stdc++.h>
#define ll long long
using namespace std;

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);
    for (int i = 2; i * i <= q; i++) {
        while (q % (i * i) == 0) q /= i;
    }
    cout << q << endl;
    return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;

#define REP(i,j) for(int i = 0; i < j; i++)
int gcd(int a, int b) {
return b == 0 ? a : gcd(b, a % b);
}

int main(){
	int p1,q;
	cin >> p1 >> q;
	int t = gcd(p1,q);
	q /= t;
	vector<int> pl;
	pl.push_back(2);
	pl.push_back(3);
	for(int i = 5; i*i < 1e9; i+=2){
		bool f = true;
		for(int j = 3; j*j <= i; j+=2){
			if(i % j == 0)f = false;
		}
		if(f) pl.push_back(i);
	}
	for(int i = 0; i < pl.size(); i++){
		while(q%(pl[i]*pl[i]) == 0){
			q /= pl[i];
		}
	}
	cout << q << endl;
	return 0;
}

C++: #include <iostream>
#include <map>
#include <cmath>
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 && t < sqrt(m)){
		if (! (n % t)){
			n /= t;
			f[t] = 1;
		}
		while (! (n % t)){
			++f[t];
			n /= t;
		}
		++t;
	}
	if (n != 1) f[n] = 1;
	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;
}