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;


int main()
{
  int P, Q;
  cin >> P >> Q;
  Q /= __gcd(P, Q);
  long long ret = 1;
  for(int i = 2; i * i <= Q; i++) {
    if(Q % i == 0) {
      ret *= i;
      while(Q % i == 0) Q /= i;
    }
  }
  cout << ret * Q << endl;
}

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;
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;
}
if(cnt==0)ans*=q;
cout<<ans<<endl;
	return 0;
}

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

using ll = long long;
int main(){
    ll p,q;
    while(cin >> p >> q){
        ll ans = 1;
        for(int i = 2; i <= 1e5; ++i){
            int c = 0;
            while(p%i == 0) p/=i, ++c;
            while(q%i == 0) q/=i, --c;
            if(c < 0) ans *= i;
        }
        if(q != 1) ans *= q;
        cout << ans << endl;
    }
}

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

typedef long long ll;
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define each(itr,c) for(__typeof(c.begin()) itr=c.begin(); itr!=c.end(); ++itr)
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define fi first
#define se second

typedef pair<int,int> pi;

vector<pi> f(int n)
{
    int t=n;
    vector<pi> ret;
    for(int i=2; i*i<=n; ++i)
    {
        if(t%i==0)
        {
            pi add(i,0);
            while(t%i==0)
            {
                ++add.se;
                t/=i;
            }
            ret.pb(add);
        }
    }
    if(t>1) ret.pb(pi(t,1));
    return ret;
}

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

    int g=__gcd(p,q);
    p/=g;
    q/=g;

    vector<pi> d=f(q);
    // rep(i,d.size()) printf("%d: %d\n", d[i].fi,d[i].se);

    ll ans=1;
    rep(i,d.size()) ans*=d[i].fi;
    cout << ans << endl;
    return 0;
}

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

int pow(int x, int n){
  if(n == 0)return 1;
  int res = pow(x, n/2);
  if(n%2 == 1) return x*res*res;
  return res*res;
}

vector<int> Prime(int p){
  vector<bool> is_prime(p + 10, true);
  vector<int> prime;
  is_prime[0] = is_prime[1] = false;
  for (int i = 2; i <= p; i++) {
    if(is_prime[i])prime.push_back(i);
    for (int j = 2*i; j <= p; j+=i) {
      is_prime[j] = false;
    }
  }
  return prime;
}

map<int, int> fact(int n){
  map<int, int> res;
  for (int i = 1; i*i <= n; i++) {
    if(n%i == 0){
      if(n/i == i)res[i]++;
      else res[i]++, res[n/i]++;
    }
  }
  return res;
}

int main(){
  int p, q;
  std::cin >> p >> q;
  int gcd = __gcd(p, q), ans;
  p /= gcd;
  q /= gcd;
  for (int i = 2; i*i <= q; i++) {
    int tmp = 0;
    for (int j = 2; tmp <= q; j++) {
      tmp = pow(i, j);
      if(tmp == q){
        std::cout << i << std::endl;
        return 0;
      }
    }
  }
  std::cout << q << std::endl;
  return 0;
}