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;
using ll = int64_t;

ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }

int main() {
    ll P, Q;
    cin >> P >> Q;
    ll G = gcd(P, Q);
    Q /= G;
    ll ans = 1;
    ll QQ = Q;
    for(ll i = 2; i * i <= Q; i++) {
        ll cnt = 0;
        while(QQ % i == 0) {
            QQ /= i;
            cnt++;
        }
        if(cnt) ans *= i;
    }

    if(QQ > 1) ans *= QQ;

    cout << max<ll>(2, ans) << endl;
    return 0;
}

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

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

    int g = q / __gcd(p, q);
    set<int> s;
    for (int i = 1; i <= sqrt(g); i++) {
        if (g % i == 0) {
            s.insert(i);
            s.insert(g / i);
        }
    }
    int ans = 1;
    for (auto i : s) {
        bool flag = true;
        for (int j = 2; flag && j <= sqrt(i); j++) {
            if (i % j == 0) flag = false;
        }

        if (flag) ans *= i;
    }

    cout << ans << endl;

    return 0;
}

C++: #include<iostream>
using namespace std;
#define MAX 1e9
int main(){
  int p,q;
  cin>>p>>q;
  for(int i=2;i<MAX;i++){
    if(q%i==0&&p%(q/i)==0){
      cout<<i<<endl;
      break;
    }
  }
  return 0;
}

C++: #include <iostream>
#include <cmath>
#define MIN(a,b) ((a>b)?b:a)
using namespace std;

int lcm(long int a,long int b){
    if(a<b){swap(a,b);}
    if(!b){return a;}
    return lcm(b,a%b);
}

int main(){
    long int i,p,q,lc,cl;
    double lm,buf,df,m;
    cin>>p>>q;
    lc=lcm(p,q);
    p/=lc;q/=lc;
    lm=log(q)/log(2);
    cl=(int)lm+1;
    for(i=1;i<=cl;i++){
        buf=pow(q,(double)1/i);
        df=(int)buf+1-buf;
        if(df==1 || df<0.0001){
            m=buf;
        }
    }
    cout<<(long int)m<<endl;
    return 0;
}

C++: #include "bits/stdc++.h"

using namespace std;

typedef long long ll;
//a,b???GCD
ll gcd(ll a, ll b) {
	if (b == 0) return a;
	return gcd(b, a%b);
}

//?´???°??????
vector<ll> divisor(ll n){
    vector<ll> res;
    //res.push_back(1);res.push_back(n);
    ll tmp=n;
    for(int i=2;i<=tmp;i++){
        if(tmp%i!=0)continue;
        if(i==n) break;
        res.push_back(i);
        while(tmp%i==0){
            tmp/=i;
        } 
    }
    sort(res.begin(),res.end());
    return res;
}

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

    ll p,q;cin>>p>>q;
    ll g=gcd(p,q);
    p/=g;q/=g;
    vector<ll> res=divisor(q);
    if(res.size()==0) cout<<q<<endl;
    else{
        ll ret=1;
        for(int i=0;i<(int)res.size();i++) ret*=res[i];
        cout<<ret<<endl;
    }
}

C++: #include <iostream>
#include <algorithm>
//#include <numeric>
using namespace std;
#define FOR(i,a,b) for (size_t i = a; i < b; i++)
#define REP(i,b) FOR(i,0,b)
#define RFOR(i,a,b) for (size_t i = a-1; i >= b; i--)
#define RREP(i,a) RFOR(i,a,0)
#define INF 1e7

long gcd(long a, long b)
{
  long r;
  do {
    r = b % a;
    //printf("%ld = %ld * ? + %ld\n", b, a, r);
    b = a;
    a = r;
  } while(r);

  return b;
}

long search_root(long a)
{
  int ans = 1, tmp = a;
  for (int i = 2; i * i <= tmp; i++) {
    //cout<<i<<tmp<<endl;
    if (tmp % i == 0) {
      ans *= i;
      while (tmp % i == 0) tmp /= i;
    }
  }

  return ans * tmp;
}

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

  cout<<search_root(q / gcd(p, q))<<endl;

  return 0;
}

C++: #include <bits/stdc++.h>
#define rep(i, a, n) for(int i = a; i < n; i++)
#define repb(i, a, b) for(int i = a; i >= b; i--)
#define all(a) a.begin(), a.end()
#define o(a) cout << a << endl
#define int long long
#define first fi;
#define second se;
using namespace std;
typedef pair<int, int> P;

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

signed main(){
    int p, q;
    cin >> p >> q;
    q /= gcd(p, q);
    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;
}