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;

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

typedef pair<long long, long long> P;
void factor(long long n, vector<P> &v){
	vector<long long> p;
	for(int i=2; i<=n; ++i){
		bool f = true;
		for(int j=0; j<p.size(); ++j)
			if(i % p[j] == 0){
				f = false;
				break;
			}
		if(f) p.push_back(i);
	}
	for(int i=0; i<p.size(); ++i){
		int t = 0;
		while(n % p[i] == 0){
			n /= p[i];
			++t;
		}
		v.push_back(P(p[i], t));
		if(n == 1) break;
	}
}

int main(){
//	cin.tie(0);
//	ios::sync_with_stdio(false);
	cin >> p >> q;
	long long g = gcd(p, q);
	p /= g;
	q /= g;
//	cout << q << "\n";
	vector<P> v;
	factor(q, v);
	long long mi = q;
	long long ma = 1;
	for(int i=0; i<v.size(); ++i){
		mi = min(mi, v[i].second);
		ma = max(ma, v[i].second);
	}
	if(mi == ma){
		long long t = 1;
		for(int i=0; i<v.size(); ++i)
			t *= v[i].first;
		q = t;
	}
	cout << q << "\n";
}

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

int gcd(int a,int b){
    if(a<b){swap(a,b);}
    if(!b){return a;}
    return gcd(b,a%b);
}

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

C++: #include<bits/stdc++.h>
using namespace std;
#define N 1000000000
typedef long long int ll;
ll gcd(ll a,ll b){
if(b==0)return a;
else return gcd(b,a%b);

}
queue<ll> q;
vector<bool> prime(N+1,true);
void make(ll M){
	prime[0]=prime[1]=false;
	ll i;
	for( i=2;i*i<=M+1;i++){
	if(prime[i]){
		ll j=2;
		q.push(i);
	while(i*j<M+1){
	prime[i*j]=false;
	j++;
		}

	}

	}
/*	for(;i<=M;i++){
		if(prime[i])q.push(i);
	}*/
return;

}
int main(){
ll a,b;
//cout<<"ok"<<endl;

cin>>a>>b;
//make(max(a,b));
//cout<<"ok"<<endl;
//cout<<b/gcd(a,b)<<endl;
ll c=b/gcd(a,b);
//cout<<c<<endl;
ll ans = 1;
ll ma = c;
for(ll i=2;i*i<=ma;i++){
	if(c%i==0){
	ans*=i;
	while(c%i==0)c/=i;
	}
}
/*while(!q.empty()){
	ll d = q.front();
//	cout<<d<<endl;
if(c%d==0){
	while(c%d==0)c/=d;
	ans*=d;
}
q.pop();
}*/

//cout<<ans<<' '<<c<<endl;
ans*=c;
cout<<ans<<endl;
return 0;

}

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

using namespace std;

typedef long long ll;

int gcd(int p,int q){
    return p % q == 0 ? q : gcd(q, p%q);
}


vector<int> makeprime(int num){
    vector<bool> n(num+1,true);
    n[0]=n[1]= false;
    for(int i = 2; i < num+1; i++){
        if(n[i]){
            for(int j = 2; i*j <= num+1; j++){
                n[i*j] = false;
            }
        }
    }
    vector<int> ret;
    for(int i = 2; i < num+1; i++){
        if(n[i])ret.push_back(i);
    }
    return ret;
}

signed main(){
    ll p,q; cin >> p >> q;
    if(p != 1)q /= gcd(p,q);
    /*
    ll ans = 1;
    vector<int> prime = makeprime((int)sqrt(q));
    for(int i = 0; i < prime.size(); i++){
        if(q%(ll)prime[i] == 0){
            while(q%(ll)prime[i] == 0)q /= (ll)prime[i];
            ans *= (ll)prime[i];
        }
    }
    cout << ans << endl;
    */
    cout << q << endl;
    return 0;
}