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;
#define int long long   // <-----!!!!!!!!!!!!!!!!!!!

#define rep(i,n) for (int i=0;i<(n);i++)
#define rep2(i,a,b) for (int i=(a);i<(b);i++)
#define rrep(i,n) for (int i=(n)-1;i>=0;i--)
#define rrep2(i,a,b) for (int i=(a)-1;i>=b;i--)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define printV(v) for(auto x : v){cout << x << " ";} cout << endl
#define printVS(vs) for(auto x : vs){cout << x << endl;}
#define printVV(vv) for(auto v : vv){for(auto&& x : v){cout << x << " ";}cout << endl;}
#define printP(p) cout << p.first << " " << p.second << endl
#define printVP(vp) for(auto p : vp) printP(p);

typedef long long ll;
typedef pair<int, int> Pii;
typedef tuple<int, int, int> TUPLE;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<Pii> vp;
typedef vector<vector<int>> Graph;
const int inf = 1e9;
const int mod = 1e9 + 7;

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

bool check(int q, int i) {
    while (q % i == 0) {
        q /= i;
        if (q == 1) {
            return true;
        }
    }
    return false;
}

signed main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(0);

    int p, q;
    cin >> p >> q;
    int g = gcd(p, q);
    p /= g;
    q /= g;

    rep2(i, 2, 100000) {
        if (check(q, i)) {
            cout << i << endl;
            return 0;
        }
    }

    cout << q << endl;

}

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

int main() {
	int p, q, mi, ans, temp;

	cin >> p >> q;

	mi = (p ,q);

	while (p%q == 0) {
		if (q == 1) break;
		p /= q;
		q /= q;
	}

	for (int i = 2; i * i<= mi; i++) {
		while (p%i == 0 && q%i == 0) {
			p /= i;
			q /= i;
		}
		while (q%(mi/i) == 0 && p%(mi/i) == 0) {
			p /= (mi/i);
			q /= (mi/i);
		}

	}

	ans = 1;


	for (int i = 2; i * i <= q; i++) {
		if (q%i != 0) continue;
		int k = 1;
		if (i != 2){
			for (int j = 3; j * j<= i; j++) {
				if (i%j == 0) {
					k = 0;
					break;
				}
			}
		}
		if (k == 1) ans *= i;
		while (q%i == 0) {
			q /= i;
		}
	}
	ans *= q;

	cout << ans << endl;

	return 0;
}

C++: #include <bits/stdc++.h>
#define rep(i,j) for (int (i)=0;(i)<(int)(j);++(i))
using namespace std;
using ll = long long;
using P = pair<ll, ll>;

int main() {
    int p, q;
    cin >> p >> q;
    int k = __gcd(p, q);
    p /= k;
    q /= k;
    int q_ = q;
    vector<pair<int, int>> ans;
    for (int i=2; i<=sqrt(q); ++i) {
        if (q_%i == 0) {
            pair<int, int> p = make_pair(i, 1);
            q_ /= i;
            while (q_%i == 0) {
                p.second++;
                q_ /= i;
            }
            ans.push_back(p);
        }
    }
    if (q_ > 1) ans.push_back(make_pair(q_, 1));
    int a = 1;
    for (int i = 0; i < ans.size(); ++i) {
        a *= ans[i].first;
    }
    cout << a << endl;
    return 0;
}

C++: #include <bits/stdc++.h>
#define REP(i,n) for (int i=0;i<(n);i++)
using namespace std;
int gcd(int a,int b){
    if(b==0)return a;
    return gcd(b,a%b);
}
int main(){
    int p,q;
    cin>>p>>q;
    int r=gcd(q,p);
    p/=r;q/=r;
    int ans=1;
    for(int i=2;i*i<=q;i++){
        if(q%i!=0)continue;
        ans*=i;
        while(q%i==0)q/=i;
    }
    ans*=q;
    cout<<ans<<endl;
}

C++: #include<bits/stdc++.h>
using namespace std;
int main(){
  int q,p,t,ans=1,i,j,c;
  cin>>q>>p;t=p;
  p/=__gcd(q,p);
  if(p%3==0)ans*=3;
  if(p%2==0)ans*=2;
  for(i=5;i*i<=t;i++)
    if(p%i==0)ans*=i;
  cout<<ans<<endl;
}

C++: #include <cstdio>
#include <utility>

int gcd(int m, int n) {
  while (n) std::swap(m %= n, n);
  return m;
}

int main() {
  int p, q;
  scanf("%d %d", &p, &q);

  int m = q / gcd(p, q);
  int res = 1;
  for (int i = 2; i*i <= m; ++i) {
    if (m % i == 0) {
      res *= i;
      do {
        m /= i;
      } while (m % i == 0);
    }
  }

  if (m > 1) res *= m;
      
  printf("%d\n", res);
}