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 <vector>
#include <cmath>

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;

	//	エラトステネスの篩

	const ll M = sqrt(10e16);
	std::vector< bool > isPrime(M, true);
	isPrime[1] = false;

	for (ll i = 2; i < M; i++) {
		if (isPrime[i] == false) { continue; }
		for (ll j = 2; i * j < M; j++) {
			isPrime[i*j] = false;
		}
	}

	ll ans = 1;
	
	for (ll i = 2; i < M; i++) {
		if (isPrime[i] == true && q % i == 0 ) {
			ans *= i;
		}
	}
	
	if( ans == 1 && q > 1 ) { ans = q; }
	
	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;
		}
	}
}

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;
int cnt=0;

for(int i=0;i<primes.size();i++){
	int now=primes[i];
	if(q%now==0){ans*=now,cnt++;}
	while(q%now==0)q/=now;

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

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

ll power(ll e, ll x) {
  if (x == 0)
    return 1;
  if (x % 2 == 0)
    return power(e * e, x / 2);
  return e * power(e, x - 1);
}

int main() {
  ll a, b;
  cin >> a >> b;
  a %= b;
  map<ll, int> amp, bmp;
  for (ll i = 2; i * i <= a; i++) {
    if (a % i == 0) {
      amp[i]++;
      a /= i;
      i--;
    }
  }
  for (ll i = 2; i * i <= b; i++) {
    if (b % i == 0) {
      bmp[i]++;
      b /= i;
      i--;
    }
  }
  if (a > 1)
    amp[a]++;
  if (b > 1)
    bmp[b]++;
  ll ans = 1;
  for (auto &v : bmp) {
    if (v.second - amp[v.first] >= 1)
      ans *= v.first;
  }
  cout << ans << endl;
  return 0;
}

C++: #include<stdio.h>
#include<math.h>
#include<iostream>
#include<string>
#include<algorithm>
#include<math.h>
#include<set>
#include<map>
#include<vector>
#include<stack>
#include<queue>
#include<cmath>
#include<numeric>
using namespace std;

int yaku(int n,int m){
    if(n%m==0){
        return m;
    }
    return yaku(m,n%m);
}


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

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

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;

	//	エラトステネスの篩

	const ll M = sqrt(10e9) + 10;
	std::vector< bool > isPrime(M, true);
	isPrime[1] = false;

	for (ll i = 2; i < M; i++) {
		if (isPrime[i] == false) { continue; }
		for (ll j = 2; i * j < M; j++) {
			isPrime[i*j] = false;
		}
	}

	ll ans = 1;
	
	for (ll i = 2; i < (ll)sqrt(M); i++) {
		if (q % i == 0 && isPrime[i] == true ) {
			ans *= i;
		}
	}
	
	if( ans == 1 && q > 1 ) { ans = q; }
	
	cout << ans << endl;

	return 0;
}