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;
bool prime[200000];

int main(){

  for(int i=2;i*i<200000;i++)
    for(int j=2;j<200000/i&&!prime[i];j++) prime[i*j]=1;

  vector <int> n;
  for(int i=2;i<200000;i++)if(!prime[i])n.push_back(i);
					      
  int p,q;
  cin>>p>>q;
  int a=__gcd(p,q);
  p/=a,q/=a;
  
  int ans=1;
  for(int i=0;i<n.size();i++)
    if(q%n[i]==0){
      ans*=n[i];
      while(q%n[i]==0)q/=n[i];
    }
  ans*=q;
  cout << ans<<endl;
  return 0;

}

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

C++: #include<stdio.h>
#include<math.h>

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

bool judgeprime(int n){
    if(n == 1 || n % 2 == 0)
        return false;
    int  i,j;
    j = (int)sqrt(n);
    bool k = true;
    for(i = 3;i < j;i += 2)
        if(n % i == 0){
            k = false;
            break;
        }
    return k;
}

int nextprime(int prime){
    prime++;
    while(judgeprime(prime++) == false);
    return prime - 1;
}

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

    q /= gcd(p,q);

    int prime = 2,ans = 1;

    while(q > 1){
        if(q % prime == 0){
            ans *= prime;
            while(q % prime == 0)
                q /= prime;
        }
        if(judgeprime(q)){
            ans *= q;
            break;
        }
        prime = nextprime(prime);
    }
    printf("%d\n",ans);
    return 0;
}

C++: #include <bits/stdc++.h>

using namespace std;

using ll = long long;
using Pi = pair<int, int>;
using Pl = pair<ll, ll>;
using Ti = tuple<int, int, int>;
using Tl = tuple<ll, ll, ll>;

#define pb push_back
#define eb emplace_back
#define mp make_pair
#define mt make_tuple
#define F first
#define S second
#define Get(t, i) get<(i)>((t))
#define all(v) (v).begin(), (v).end()
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define reps(i, f, n) for(int i = (int)(f); i < (int)(n); i++)
#define each(a, b) for(auto& a : b)

const int inf = 1 << 25;
const ll INF = 1LL << 55;

int main()
{
  ll p, q;
  cin >> p >> q;
  vector<int> factor;
  q = q / __gcd(p, q);
  for(int x = 2; x*x <= q; x++) {
    if(q % x == 0) {
      factor.push_back(x);
      while(q % x == 0) q /= x;
    }
  }
  if(q != 1) factor.push_back(q);
  ll ans = 1;
  rep(i, factor.size()) ans *= factor[i];
  cout << ans << endl;
  return 0;
}

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

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

    int p, q;
    cin >> p >> q;
    int g = __gcd(p, q);
    q /= g;
    int ans = 1;
    for (int i = 2; i * i <= q; i++) {
        if (q % i == 0) {
            ans *= i;
            while (q % i == 0) {
                q /= i;
            }
        }
    }
    if (q > 1) ans *= q;
    cout << ans << endl;
}

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

using std::cin;
using std::cout;
using std::endl;

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

int main(void) {
	int p,q;
	cin >> p >> q;
	int n = q;
	int m = p;
	int l = gcd(n,m);
	while ( l != 1 ) {
		n = n/l;
		m = m/l;
		l = gcd(n,m);
	}
	if ( (int)sqrt(n) == sqrt(n) ) {
		cout << sqrt(n) << endl;
	}
	else {
		cout << n << endl;
	}
	return 0;
}