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++: ///
// File:  2706.cpp
// Author: ymiyamoto
//
// Created on Tue Dec 19 01:28:01 2017
//

#include <cmath>
#include <cstdint>
#include <iostream>

using namespace std;

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

int32_t main()
{
  uint64_t p, q;
  cin >> p >> q;

  uint64_t g = gcd(p, q);
  p /= g;
  q /= g;

  for (uint64_t i = 2; i <= (uint64_t)sqrt(q); i++) {
    uint64_t tmp = q;
    while (tmp > 1) {
      if (tmp % i == 0) {
        tmp /= i;
      } else {
        break;
      }
    }
    if (tmp == 1) {
      cout << i << endl;
      return 0;
    }
  }
  cout << q << endl;

  return 0;
}

C++: #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define shosu(n) setprecision(n)
#define INF 999999999
using namespace std;
long long gcd(long long a, long long b) {
  while (b)
    b ^= a ^= b ^= a %= b;
  return a;
}
int main() {
  long long A, B, v = 1;
  cin >> A >> B;
  B /= gcd(A, B);
  for (int i = 2; i * i < B; i++) {
    if (B % i == 0) {
      v *= i;
      while (B % i == 0)
        B /= i;
    }
  }
  cout << B * v << endl;
  return 0;
}

C++: #include<iostream>
using namespace std;
int p,q,ans=1,j;

int so(int n){
  for(int i=2;i*i<=n;i++)if(n%i==0)return 1;
  return 0;
}

int main(){
  cin>>p>>q;
  if(so(q)){
    for(int i=2;q>=i;i++){
      for(j=0;q%i==0;j++)q/=i;
      if(j==0)continue;
      if(p%i==0&&j==1)p/=i;
      else ans*=i;
    }
    cout<<ans<<endl;
  }else cout<<q<<endl;
  return 0;
}

C++: #include<iostream>
#include<cstdio>
#include<string>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
using namespace std;
typedef long long ll;
const ll MOD = 1000000007;
const ll INF = (ll)1000000007 * 1000000007;
const double EPS = 1e-9;
typedef pair<int, int> P;
typedef unsigned int ui;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
int gcd(int a, int b) {
	if (b == 0)return a;
	return gcd(b, a%b);
}
int main() {
	int isp[100000] = {};
	vector<int> v;
	Rep(i, 2, 100000) {
		if (!isp[i]) {
			v.push_back(i);
			for(int j=2*i;j<100000;j+=i){
				isp[j] = 1;
			}
		}
	}
	int p, q; cin >> p >> q;
	int d = gcd(q,p);
	q /= d;
	int out = 1; int now = 0;
	while (q > 1) {
		if (q%v[now] == 0) {
			out*=v[now];
			while (q%v[now] == 0)q /= v[now];
		}
		else if (v[now] > (int)sqrt(q + 0.5)) {
			out *= q; q = 1;
		}
		else now++;
	}
	if (out == 1)out = 2;
	cout << out << endl;
	return 0;
}

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

using namespace std;
typedef long long ll;
const ll INF = 1LL << 50;

int solve();

ll gcd(ll p, ll q) {
	if (q == 0) { return p; }
	return gcd(q, p%q);
}

int main(void) {
	while (solve()) {}
	return 0;
}

int solve() {

	ll p, q, g;

	cin >> p >> q;

	g = gcd(max(p, q), min(p, q));

	//	約分
	p = p / g;
	q = q / g;

	//	エラトステネスの篩

	const ll M = sqrt(10e9) + 1;
	std::vector< bool > isPrime(M, true);
	isPrime[1] = false;

	for (ll i = 2; i < M; i++) {
		if (isPrime[i] == false) { continue; }
		for (ll j = i; i * j < M; j++) {
			isPrime[i*j] = false;
		}
	}

	ll ans = 1;
	for (ll i = 2; i < M; i++) {
		if (q % i == 0 && isPrime[i] == true ) {
			ans *= i;
		}
	}

	if( q > 1 && ans == 1 ) { ans = q;}
	
	
	cout << ans << endl;


	return 0;
}