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(){
		long long p,q;
		cin >> p >> q;
		for(long long i=2;i*i<=q;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*i<=q;i++){
			if((double)pow(q,(float)1/i)-(long long int)pow(q,(float)1/i)==0){
				q/=(long long int)pow(q,(float)1/i);
			}
		}
		cout << q << endl;
		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; q != 1; x++) {
    if(q % x == 0) {
      factor.push_back(x);
      while(q % x == 0) q /= x;
    }
  }
  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

signed main(){

  int p,q; cin >> p >> q;

  int ans = q / __gcd(p,q);
  map<int,int> mp;
  for(int i = 2; i*i <= ans; i++){
    while(ans%i == 0){
      mp[i]++;
      ans /= i;
    }
  }
  if(ans != 1) mp[ans] = 1;

  int res = 1;
  for(auto p : mp){
    if(p.second > 0) res *= p.first;
  }
  cout << res << endl;

  return 0;
}

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

using namespace std;
typedef long long ll;

ll gcd ( ll a, ll b ){
  ll c;
  while ( a != 0 ) {
     c = a; a = b%a;  b = c;
  }
  return b;
}

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

  ll p,q;
  cin >>p>>q;
  ll g=gcd(p,q);
  ll res=q/g;
//  if(res==1) res=10;
  cout << max(res,2) <<endl;
}

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

#define REP(i, n, N) for(ll i=(n); i<(N); i++)
#define RREP(i, n, N) for(ll i=(N-1); i>=(n); i--)
#define LREP(lst,itr) for(auto itr = lst.begin(); itr != lst.end(); ++itr)
#define CK(n, a, b) ((a)<=(n)&&(n)<(b))
#define ALL(v) (v).begin(),(v).end()
#define MCP(a, b) memcpy(b,a,sizeof(b))
#define P(s) cout<<(s)<<endl
#define P2(a, b) cout<<(a)<<" "<<(b)<<endl
#define V2(T) vector<vector<T>>
typedef long long ll;
using namespace std;
const ll MOD = 1e9 + 7;
const ll INF = 1e18;

ll gcd(ll A,ll B){
    if(A<B) swap(A,B);
    return (B==0 ? A : gcd(B,A%B));
}

int main(){
    ll p,q,tar,ans=1;
    cin >> p >> q;

    tar = q/gcd(q,p);

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

C++: #include <bits/stdc++.h>
using namespace std;
bool prim[20000000];

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*i<=q;i++)
    if(prim[i]==0&&q%i==0){
      for(int j=2;j<20000000/i;j++) prim[i*j]=1;
    }

  for(int i=2;i<20000000;i++) if(prim[i]==0&&q%i==0)ans*=i;

  if(ans==1)ans=q;
  cout <<ans<<endl;  

  return 0;
}

C++: #include<cstdio>

long long int gcd(long long int p, long long int q) {
    if(!q) return p;
    if(q>p) return gcd(q, p);
    return gcd(q, p%q);
}

int main(void) {
    long long int p,q;
    scanf("%lld%lld",&p,&q);
    long long int g = gcd(p,q);
    p/=g; q/=g;

    long long int b=1;
    for(long long int i=2; q-1; i++)
        if(!(q%i)) {
            b*=i;
            while(!(q%i)) q/=i;
        }
    printf("%lld\n",b);

}

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

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

    int g = __gcd(p,q);

    cout << q / g << endl;

    return 0;
}