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<cstdio>
#include<algorithm>
#include<cmath>
int era[100000];
using namespace std;
int main(void)
{
	int p,q,i,j,kou,x,a,b,suu,flg;
	scanf("%d %d",&p,&q);
	a=q;	b=p;
	while(1)	{
		x=a%b;
		if(x==0)	break;
		a=b;
		b=x;
	}
	for(i=2;i<=100000;i++)	era[i]=1;
	for(i=2;i*i<=100000;i++)	{
		if(era[i]==1)	{
			for(j=2;j*i<=100000;j++)	{
				era[i*j]=0;
			}
		}
	}
	
	
	kou=b;
	x=q/kou;
	a=1;
	for(i=2;i<=100000;i++)	{
		if(era[i]==1 && x%i==0)	{
			a=a*i;
			while(x%i==0)	x/=i;
		}
		if(x==1)	break;
	}
	if(x!=1)	a=a*x;
	printf("%d\n",a);
	return 0;
}

C++: #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define shosu(n) setprecision(n)
#define INF 999999999
using namespace std;
bool sosu(int n) {
  if (n <= 1)
    return false;
  for (int i = 2; i * i <= n; i++)
    if (n % i == 0)
      return false;
  return true;
}
long long gcd(long long a, long long b) {
  while (b)
    b ^= a ^= b ^= a %= b;
  return a;
}
int main() {
  long long A, B, i = 2;
  cin >> A >> B;
  long long W = B / gcd(A, B);
one:;
  for (int i = 2; i < sqrt(W); i++) {
    if (W == i * i) {
      W = i;
      goto one;
    }
  }
  cout << W << endl;
  return 0;
}

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;
	q /= GCD(p, q);
	int ans = q;
	set<int> sta;
	for(int i = 2; i * i <= q; i++){
		if(q % i == 0) sta.insert(i);
	}
	set<int>::iterator it;
	for(it = sta.begin(); it != sta.end(); it++){
		int num = 1;
		while(num < q) num *= (*it);
		if(num == q && (*it) < ans) ans = (*it);
	}
	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=30000000;
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 gcd(int a,int b){
	if(b==0)return a;
	return gcd(b,a%b);
}
int main(){
eratosu();
	cin>>p>>q;

/*
for(int i=0;i<primes.size();i++){
	int now=primes[i];
	while(q%now==0&&p%now==0)q/=now,p/=now;
}*/
int gc=gcd(p,q);
int np=p,nq=q;
p=np/gc;
q=nq/gc;

int ans=1,qq=q;
for(int i=0;i<primes.size();i++){
	int now=primes[i];

	if(q%now==0)ans*=now;
	while(q%now==0)q/=now;

	//if(now>sqrt(qq))break;
}
cout<<ans<<endl;
	return 0;
}

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

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

	cout<<ans<<endl;

  return 0;
}