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; 

#define INF 1001000100010001000
#define MOD 1000000007
#define EPS 1e-10
#define int long long
#define rep(i, N) for (int i = 0; i < N; i++)
#define Rep(i, N) for (int i = 1; i < N; i++)
#define For(i, a, b) for (int i = (a); i < (b); i++)
#define pb push_back
#define mp make_pair
#define i_i pair<int, int>
#define vi vector<int>
#define vvi vector<vi >
#define vb vector<bool>
#define vvb vector<vb >
#define vp vector< i_i >
#define all(a) (a).begin(), (a).end()
#define Int(x) int x; scanf("%lld", &x);

//int dxy[5] = {0, 1, 0, -1, 0};
// assign??

vi prime;

int gcd(int a, int b)
{
if (a == 1) { 
return b;
} else {
return gcd(b, b%a);
}
}

void pri()
{
vector<bool> state(5001, false);
for (int i = 2; i < 5000; i++) {
if (!state[i]) {
prime.pb(i);
for (int j = 2; i*j < 5000; j++) {
state[i*j] = true;
}
}
}
}


signed main()
{
pri();
Int(p)
Int(q)
while (p && q) { 
if ( p >= q) {
cout << 2 << endl;
} else {
int ret = gcd(p, q);
int ans = 1;
while (ret != 1) {
rep(i, prime.length()) {
if (!(ret % prime[i])) {
ans *= prime[i];
ret /= prime[i];
}}}
cout << ans << endl;
}
cin >> p >> q;}


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;
}

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

int gcd(int x, int y) {
    return y == 0 ? x : gcd(y, x%y);
}

int P, Q;

int main() {
    cin >> P >> Q;
    int v = Q / gcd(P, Q);
    for (int d = 2; d*d <= v; ++d) {
        while ((v/d)%d == 0) { v /= d; }
    }
    cout << max(2, v) << endl;
}

C++: #include <bits/stdc++.h>

using namespace std;

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

int solve(int n) {
  int res = 1;
  for (int i = 2; i * i <= n; i++) {
    if (n % i) continue;
    res *= i;
    while (n % i == 0) n /= i;
  }
  if (n != 1) res *= n;
  return res;
}

int main(void) {
  int p, q;
  cin >> p >> q;
  
  cout << solve(q / gcd(p, q)) << endl;

  return 0;
}

C++: #include <iostream>
#include <vector>
#define REP(i, a, n) for(int i = ((int) a); i < ((int) n); i++)
using namespace std;
typedef long long ll;

int P, Q;
bool p[100000];
vector<int> v;

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

bool prime(int n) {
  REP(i, 0, v.size()) if(n % v[i] == 0) return false;
  return true;
}

ll solve() {
  ll ans = 1;
  REP(i, 0, v.size()) if(Q % v[i] == 0) {
    ans *= v[i];
    while(Q % v[i] == 0) Q /= v[i];
  }
  if(prime(Q)) ans *= Q;
  return ans;
}

int main(void) {
  REP(i, 0, 100000) p[i] = true;
  p[0] = p[1] = false;
  REP(i, 0, 100000) if(p[i]) for(int j = i * 2; j < 100000; j += i) p[j] = false;
  REP(i, 0, 100000) if(p[i]) v.push_back(i);

  cin >> P >> Q;
  Q = Q / gcd(P, Q);
  cout << solve() << endl;
  return 0;
}

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

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



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

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