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>
using namespace std;
int main(){

  int p,q,use;
  int so[40000]={0};

  cin>>p>>q;
  use=q;
  int a;
  while(q%p){
    a=q%p;
    q=p;
    p=a;
  }
  use/=p;
  vector <int> sonaka;
  for(int i=2;i<40000;i++) if(!so[i]){
      sonaka.push_back(i);
      for(int j=i*2;j<40000;j+=i) so[j]=1;
    }
  int result=1;
  for(int i=0;sonaka[i]<=use&&i<sonaka.size();i++) if(use%sonaka[i]==0){
      result*=sonaka[i];
      while(use%sonaka[i]==0) use/=sonaka[i];
  }
  cout<<result*use<<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;

  int ans=1;
  for(int i=2;i<=q;i++){
    if(q%i==0){
      ans*=i;
      while(q%i==0)q/=i;
    }
  }
  cout << ans<<endl;

  return 0;
}

C++: #include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i,n) for(int i=0;i<(int)n;++i)
#define each(a, b) for(auto (a): (b))
#define all(v) (v).begin(),(v).end()
#define fi first
#define se second
#define pb push_back
#define show(x) cout <<#x<<" = "<<(x)<<endl
#define spair(p) cout <<#p<<": "<<p.fi<<" "<<p.se<<endl
#define svec(v) cout<<#v<<":";rep(i,v.size())cout<<" "<<v[i];cout<<endl
#define sset(s) cout<<#s<<":";each(i,s)cout <<" "<<i;cout<<endl

using namespace std;

typedef pair<int,int>P;

const int MAX_N = 100005;

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

int main()
{
    int p,q;
    cin >> p >> q;
    q /= gcd(p,q);
    int mx = (int)(sqrt(q));
    int ans = 1;
    for(int i=2;i<=mx;i++){
        if(q % i == 0){
            ans *= i;
            while(q % i == 0){
                q /= i;
            }
        }
    }
    if(q != 1){
        ans *= q;
    }
    cout << ans << "\n";
    return 0;
}

C++: #include <bits/stdc++.h>
int main() {
    int p, q; scanf("%d%d", &p, &q);
    q /= std::__gcd(p,q);
    long long ans = 1;
    for(int i=2; i*i<=q ; i++) {
        if(!(q % i)) {
            ans *= i;
            while(!(q % i)) q /= i;
        }
    }
    printf("%lld\n", ans*q);
}

C++: #include "iostream"
#include "climits"
#include "list"
#include "queue"
#include "stack"
#include "set"
#include "functional"
#include "algorithm"
#include "string"
#include "map"
#include "unordered_map"
#include "unordered_set"
#include "iomanip"
#include "cmath"
#include "random"
#include "bitset"
#include "cstdio"

using namespace std;

const long long int MOD = 1000000007;

long long int N, M, K, H, W, L, R;

int gcd(int a, int b) {
	if (a < b)swap(a, b);
	while (b) {
		a %= b;
		swap(a, b);
	}
	return a;
}

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

	cin >> N >> M;
	M /= gcd(N, M);
	for (int i = 2; i*i <= M; i++) {
		long long int box = i;
		long long int div = 1;
		while (box < M) {
			box *= i;
			if (M%box == 0)div *= i;
		}
		M /= div;

	}
	cout << M<< endl;
	return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n)   FOR(i,0,n)
#define pb emplace_back
typedef long long ll;
typedef pair<int,int> pint;

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

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