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<algorithm>
#include<map>
#include<vector>
#include<set>
#include<cmath>
using namespace std;

int pow(int x, int n){
  if(n == 0)return 1;
  int res = pow(x, n/2);
  if(n%2 == 1) return x*res*res;
  return res*res;
}

vector<int> Prime(int p){
  vector<bool> is_prime(p + 10, true);
  vector<int> prime;
  is_prime[0] = is_prime[1] = false;
  for (int i = 2; i <= p; i++) {
    if(is_prime[i])prime.push_back(i);
    for (int j = 2*i; j <= p; j+=i) {
      is_prime[j] = false;
    }
  }
  return prime;
}

map<int, int> fact(int n){
  map<int, int> res;
  for (int i = 1; i*i <= n; i++) {
    if(n%i == 0){
      if(n/i == i)res[i]++;
      else res[i]++, res[n/i]++;
    }
  }
  return res;
}

int main(){
  int p, q;
  std::cin >> p >> q;
  int gcd = __gcd(p, q), ans;
  p /= gcd;
  q /= gcd;
  for (int i = 2; i*i <= q; i++) {
    int tmp = i;
    for (int j = 2; tmp <= q; j++) {
      tmp *= i;
      if(tmp == q){
        std::cout << i << std::endl;
        return 0;
      }
    }
  }
  std::cout << q << std::endl;
  return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
#define FOR(i,k,n) for(int i = (int)(k); i < (int)(n); i++)
#define REP(i,n) FOR(i,0,n)
#define ALL(a) a.begin(), a.end()
#define MS(m,v) memset(m,v,sizeof(m))
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<string> vs;
typedef pair<int, int> pii;
const int MOD = 1e9 + 7;
template<class T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template<class T> T &chmax(T &a, const T &b) { return a = max(a, b); }
template<class T>
istream& operator >> (istream& is, vector<T>& v)
{
	for (auto &i : v) is >> i;
	return is;
}
template<class T>
ostream& operator<<(ostream& os, vector<T>& v)
{
	const string delimiter = "\n";
	REP(i, v.size())
	{
		os << v[i];
		if (i != v.size() - 1) os << delimiter;
	}
	return os;
}
/*--------------------template--------------------*/

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

int main()
{
	cin.sync_with_stdio(false); cout << fixed << setprecision(10);
	ll a, b;
	cin >> a >> b;
	cout << b / gcd(a, b) << endl;
	return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;
const int INF = 1e9;
using ll = long long;

void bunkai(vector<ll> &a,ll x){
  ll temp=x;
  for(ll i=2;i*i<=x;i++){
    if(temp%i==0){
      a.push_back(i);
      while(temp%i==0){
	temp/=i;
      }
    }
  }
  a.push_back(temp);
  return;
}

ll gcd(ll x,ll y){
  if(x%y==0){
    return y;
  }else{
    return gcd(y,x%y);
  }
}

int main(){
  ll p,q;
  cin>>p>>q;
  ll a=gcd(q,p);
  p/=a;
  q/=a;
  //cout<<"p="<<p<<"q="<<q<<endl;
  vector<ll> soinsu;
  bunkai(soinsu,q);
  ll ans=1;
  for(ll i=0;i<soinsu.size();i++){
    ans*=soinsu[i];
    //cout<<"ans="<<ans<<endl;
  }
  cout<<ans<<endl;
  return 0;
}

C++: #include <iostream>
#include <vector>
#include <cmath>
using namespace std;

long gcd(long a, long b){
  if(b == 0)
    return a;

  return gcd(b, a%b);
}

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

  long tmp = gcd(q, p);
  p /= tmp;
  q /= tmp;

  long ans = 1;
  long root = sqrt(q) + 1;
  vector<bool> hurui(root, true);
  for(int i=2; i<=root; i++){
    if(hurui[i] == true){
      if(i <= root){
	for(int j=2*i; j<=root; j+=i){
	  hurui[j] = false;
	}
      }
      if(q%i == 0){
	ans *= i;
	while(q%i == 0)
	  q /= i;
	if(q == 1)
	  break;
      }
    }
  }
  ans *= q;

  cout << ans << endl;
  
  return 0;
}

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

#define REP(i,n) for(int i=0;i<(int)(n);i++)
#define ALL(a) (a).begin(),(a).end()

using ll = long long;

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

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