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

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;
}
cout<<q<<endl;
	return 0;
}

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

#define lambda(RES_TYPE, ...) (function<RES_TYPE(__VA_ARGS__)>)[&](__VA_ARGS__) -> RES_TYPE
#define method(FUNC_NAME, RES_TYPE, ...) function<RES_TYPE(__VA_ARGS__)> FUNC_NAME = lambda(RES_TYPE, __VA_ARGS__)

int main(){
    int p,q;
    method(gcd,int,int a,int b){
        while(b){
            a %= b;
            swap(a,b);
        }
        return a;
    };
    method(func,int,int x){
        int res = 1;
        for(int i=2;i*i<=x;++i){
            bool flag = false;
            while(x%i==0){
                x /= i;
                flag = true;
            }
            if(flag)res *= i;
        }
        res *= x;
        return res;
    };
    cin >> p >> q;
    cout << func(q /gcd(p,q)) << endl;
    return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;
int main(){
	int p,q;
	cin >> p >> q;
	for(int i=2;i*i<=q;i++){
		if(p%i==0&&q%i==0){
			p/=i;
			q/=i;
		}
	}
	cout << q << endl;
	return 0;
}

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

int main(){
  int p,q;
  cin>>p>>q;
  int a=__gcd(p,q);
  p/=a,q/=a;
  cout <<q<<endl;
 
  return 0;
}

C++: #include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <cstring>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <algorithm>
using namespace std;
 
#define REP(i,n) for(int i=0; i<n; ++i)
#define FOR(i,a,b) for(int i=a; i<=b; ++i)
#define FORR(i,a,b) for (int i=a; i>=b; --i)
#define pi M_PI
 
typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<VI> VVI;
typedef pair<int,int> P;
typedef pair<ll,ll> PL;

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

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

    return 0;
}

C++: #include <stdio.h>

int pr[50847534];
int x=0;

int nextpr(int p){
    int nxp = p+2;
    int i;
    int ok = 1;
    pr[x] = p;
    x++;
    if(p==2)return 3;
    while(1){
        for(i=0;pr[i]*pr[i]<=nxp;i++){
            ok = 1;
            if(nxp%pr[i]==0){
                ok = 0;
                break;
            }
        }
        if(ok){
            return nxp;
        }else{
            nxp+=2;
        }
    }
}

int main(){
    int p,q,m,oriq,ans=1;
    scanf("%d %d",&p,&q);
    oriq = q;
    m = p%q;
    while(m){
        p = q;
        q = m;
        m = p%q;
    }
    p = 2;
    oriq = q = oriq/q;
    while(q>1){
        if(q%p==0){
            ans *= p;
            while(!(q%p))q /= p;
        }
        p = nextpr(p);
        if(p*p>oriq&&oriq==q){
            ans = oriq;
            break;
        }
    }
    printf("%d\n",ans);
}

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

int euclid(int x, int y){
	int t;
	while (x % y){
		x %= y;
		t = x;
		x = y;
		y = t;
	}
	return y;
}
int main(){
	int p, q, n, m, t = 2, ans = 1;
	cin >> p >> q;
	n = q / euclid(p, q);
	m = n;
	map<int, int> f;
	while (n > 1 && t < sqrt(m) + 1){
		if (! (n % t)){
			n /= t;
			f[t] = 1;
		}
		while (! (n % t)){
			++f[t];
			n /= t;
		}
		++t;
	}
	if (n != 1) f[n] = 1;
	m = q;
	for (auto itr = f.begin(); itr != f.end(); ++itr) m = min(m, itr->second);	
	for (auto itr = f.begin(); itr != f.end(); ++itr){
		m = euclid(m, itr->second);
	}
	for (auto itr = f.begin(); itr != f.end(); ++itr){
		for (int i = 0; i < itr->second/m; ++i){
			ans *= itr->first;
		}
	}
	cout << ans << endl;
	return 0;
}