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 gcd(int a, int b) {
	return b ? gcd(b, a % b) : a;
}

int main() {
	int p, q;
	cin >> p >> q;
	p = gcd(p, q);
	q /= p;
	set<int> s;
	for (int i = 2; i <= q;) {
		if (i * i > q) {
			i = q;
		}
		if (q % i == 0) {
			q /= i;
			s.insert(i);
		} else {
			i++;
		}
	}
	int r = 1;
	for (auto it = begin(s); it != end(s); it++) {
		r *= *it;
	}
	cout << r << endl;
	return 0;
}

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

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

long gcd(long a, long b){
  if(b == 0)
    return a;

  return gcd(b, a%b);
}

int main(){
  long p, q;
  cin >> p >> q;

  long tmp = gcd(q, p);
  p /= tmp;
  q /= tmp;

  long ans = 1;
  long root = sqrt(q) + 1;
  vector<bool> hurui(q+1, true);
  for(int i=2; i<=q/2; i++){
    if(hurui[i] == true){
      if(i <= root){
	for(int j=2*i; j<=q/2; j+=i){
	  hurui[j] = false;
	}
      }
      if(q%i == 0)
	ans *= i;
    }
  }
  if(ans == 1)
    ans = q;

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

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

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

int P, Q;

int main() {
    cin >> P >> Q;
    cout << max(2, Q / gcd(P, Q)) << endl;
}

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

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;

	//	答えはqの素因数をすべて掛け合わせたもの
	//	sqrt{q}までの素数を調べる
	const ll M = (1e+9) + 1;
	const ll N = sqrt(M) + 1;
	ll ans;

	//cout << M << " " << N << endl;
	//	エラトステネスの篩
	vector<ll> primes;
	primes.reserve(5000);
	vector< bool > isPrime(M, true);
	isPrime[0] = false;
	isPrime[1] = false;

	for (ll i = 2; i < N; i++) {
		if (isPrime[i] == false) { continue; }	//	合成数なら
		primes.push_back(i);
		for (ll j = i; i * j < N; j++) {
			isPrime[i*j] = false;
		}
	}
	
	
	ll qc = q;
	set<ll> facts;
	
	for (auto p : primes) {
		if( qc % p == 0 ) {
			while(qc % p == 0)
				qc /= p;	
			if( qc % p > 0 ) {
				facts.insert(p);
			}
		}
	}
	ans = qc;
	for( auto itr = facts.begin(); itr != facts.end(); ++itr ){
		ans *= (*itr);	
	}
	
	cout << ans << endl;



	return 0;
}

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

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

bool isPrime[100000];
typedef pair<int,int> P;

int main(){
    int p,q;
    cin>>p>>q;
    int d = gcd(p,q);
    q/=d;

    fill(isPrime,isPrime+100000,true);
    isPrime[0]=isPrime[1]=false;
    for(int i=2;i<100000;i++){
        if(!isPrime[i]) continue;
        for(int k=2;i*k<100000;k++) isPrime[k*i]=false;
    }
    int r = -1;
    vector<P> V;
    int temp = q;
    for(int i=2;i<=q&&i<100000;i++){
        if(!isPrime[i]) continue;
        if(temp%i==0){
            int cnt = 0;
            while(temp%i==0){
                cnt++;
                temp/=i;
            }
            if(r==-1){
                r = cnt;
            }else{
                r = gcd(r,cnt);
            }
            V.emplace_back(i,cnt);
        }
    }
    if(r==-1||r==1){
        cout<<q<<endl;
        return 0;
    }
    int ans = 1;
    for(auto v:V){
        int k = v.first;
        for(int i = 0;i<v.second/r;i++) ans*=k;
    }
    cout<<ans<<endl;
}