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>
#include <cstdio>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <algorithm>

#define CH(N,A,B) (A<=N&&N<B)
#define REP(i,a,b) for(int i=a;i<b;i++)
#define RREP(i,a,b) for(int i=(b-1);a<=i;i--)

using namespace std;

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

vector<bool> primes;
void make_primes(int n)
{
	primes.resize(n+1, true);
	primes[0] = primes[1] = false;
	REP(i, 2, sqrt(n))
	{
		if (primes[i])
		{
			for (int j = 0; i * (j + 2) < n; j++)
				primes[i * (j + 2)] = false;
		}
	}
}

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

	q = q/gcd(p,q); /*??????????´??????????????????????*/

	vector<int> sie;
	make_primes(q);
	REP(i,0,primes.size()){
		if(primes[i]) sie.push_back(i);
	}


	set<int> s;
	int t = 0;
	while(1){
		if(q % sie[t] == 0){
			s.insert(sie[t]);
			q /= sie[t];
		}else{
			t++;
		}
		if(q == 1){
			break;
		}
	}

	long long ans = 1;
	set<int>::iterator it = s.begin();
	while(it != s.end()){
		ans *= (*it);
		it++;
	}

	cout<<ans<<endl;

  return 0;
}

C++:  
#include <bits/stdc++.h>
using namespace std;
using vi=vector<int>;
using vvi=vector<vi>;
using vs=vector<string>;
using msi=map<string,int>;
using mii=map<int,int>;
using pii=pair<int,int>;
using vlai=valarray<int>;
using ll=long long;
#define rep(i,n) for(int i=0;i<n;i++)
#define range(i,s,n) for(int i=s;i<n;i++)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define fs first
#define sc second
#define pb push_back
#define eb emplace_back
 
constexpr int gcd(int a,int b){return b?gcd(b,a%b):a;}
constexpr int lcm(int a,int b){return a*b/gcd(a,b);}
 
class Eratosthenes{
  public:
    int n, sqlim;
    vector<bool> prime;
    Eratosthenes(int N):n(N+1){
        sqlim=(int)ceil(sqrt(n));
        prime=vector<bool>(n,1); prime[0]=prime[1]=0;
        for(int i=2;i<=sqlim;i++) if(prime[i]) for(int j=i*i;j<=n;j+=i) prime[j]=0;}
    vector<int> primeArray(int s=0, int l=10000){vi ret; for(int i=s;ret.size()!=l;i++) if(prime[i]) ret.push_back(i); return ret;}
};


int main(){
	int p,q;
	cin>>p>>q;
	q/=gcd(p,q);
	vi v;
	for(int i=2;i*i<=q;i++){
	    if(q%i==0){
	        v.pb(i);
	        while(q%i==0)q/=i;
	    }
	}
	v.pb(q);
	cout<<accumulate(all(v),1,[](int a,int b){return a*b;})<<endl;
	return 0;
}

C++: #include <iostream>
#include <vector>
#include <math.h>
using namespace std;

int gcd(int a, int b){
	int temp1 = a, temp2 = b;
	if (temp1 < temp2){
		int temp;
		temp = temp1;
		temp1 = temp2;
		temp2 = temp;
	}
	if(temp2 == 0) return temp1;
	return gcd(temp2, temp1%temp2);
}

int main(){
	int p, q, m;
	cin >> p >> q;
	m = q/gcd(p,q);
	if(m == 1){
		cout << 1 << endl;
		return 0;
	}
	int temp = m, ans = 1;
	if(temp%2 == 0){
		ans *= 2;
		while(temp % 2 == 0){
			temp = temp/2;
			if(temp == 1) break;
		}
	}
	for(int i = 3;i<=m; i+=2){
		if(temp%i == 0){
			ans *= i;
			while(temp % i == 0){
				temp = temp/i;
				if(temp == 1) break;
			}
		}
	}
	cout << ans << endl;
	return 0;
}

C++: #include <iostream>
#include<cstdlib>
#include<queue>
#include<set>
#include<vector>
#include<string>
#include<algorithm>
#include<sstream>
#include<cmath>
#include<stack>
#include<map>
#include<cstdio>
using namespace std;
#define rep(i,a) for(int i=0;i<a;i++)
#define mp make_pair
#define pb push_back
#define P pair<int,int>
#define ll __int64
int p,q;
vector<int>primes;

const int MA=10000000;
bool t[MA*2];
void eratosu(){
	t[1]=1;

	for(int i=2;i<=MA;i++){
		if(t[i]==0){
			primes.push_back(i);
			for(int j=i*2;j<=MA;j+=i)t[j]=1;
		}
	}
}

bool check(int x){
	int a=x;
	int aa=x;

	while(aa<=q){
		if(aa==q)return 1;
		aa=aa*a;
	}
	return 0;
}

int main(){
eratosu();
	cin>>p>>q;

for(int i=0;i<primes.size();i++){
	int now=primes[i];
	if(now>p||now>q)break;
	while(p%now==0&&q%now==0)p/=now,q/=now;
}

for(int i=2;i<=10000;i++){
	if(check(i)){
		cout<<i<<endl;	
		break;
	}
}

	return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
int p, q, r = 1;
int main() {
	scanf("%d%d", &p, &q);
	q = q / _gcd(p, q);
	for(int i = 2; i * i <= q; i++) {
		if(q % i == 0) {
			r *= i;
			while(q % i == 0) q /= i;
		}
	}
	printf("%d\n", r * q);
	return 0;
}