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 <cmath>
using namespace std;

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

int main()
{
  int p, q;
  cin >> p >> q;
  q /= gcd(p,q);
  for(int i = 2;; i++){
    double x = log(q) / log(i);
    if(ceil(x) == floor(x)){
      cout << i << endl;
      break;
    }
  }
}

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(p%i==0)p/=i,j--;
      }
      if(j==0)continue;
      ans*=i;
    }
    cout<<ans<<endl;
  }else cout<<q<<endl;
  return 0;
}

C++: #include<iostream>
using namespace std;
int p, q; int gcd(int a, int b) { if (b == 0)return a; return gcd(b, a%b); }
int main() {
	cin >> p >> q; int res = 1; int r = gcd(p, q); q /= r;
	for (int i = 2; i*i <= q; i++) {
		if (q%i == 0) { res *= i; while (q%i == 0)q /= i; }
	}
	if (q >= 2)res *= q;
	cout << res << endl;
	return 0;
}

C++: #include <iostream>
#include <vector>
#define REP(i, a, n) for(int i = ((int) a); i < ((int) n); i++)
using namespace std;
typedef long long ll;

int P, Q;
bool p[1000000];
vector<int> v;

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

bool prime(int n) {
  REP(i, 0, v.size()) if(n % v[i] == 0) return false;
  return true;
}

ll solve() {
  ll ans = 1;
  REP(i, 0, v.size()) if(Q % v[i] == 0) {
    ans *= v[i];
    while(Q % v[i] == 0) Q /= v[i];
  }
  if(prime(Q)) ans *= Q;
  return ans;
}

int main(void) {
  REP(i, 0, 1000000) p[i] = true;
  p[0] = p[1] = false;
  REP(i, 0, 1000000) if(p[i]) for(int j = i * 2; j < 1000000; j += i) p[j] = false;
  REP(i, 0, 1000000) if(p[i]) v.push_back(i);

  cin >> P >> Q;
  Q = Q / gcd(P, Q);
  cout << solve() << endl;
  return 0;
}

C++: #include <iostream>
#include<cstdlib>
#include<queue>
#include<set>
#include<vector>
#include<string>
#include<algorithm>
#include<sstream>
#include<cmath>
#include<stack>
#include<map>
#include<cstdio>
using namespace std;
#define rep(i,a) for(int i=0;i<a;i++)
#define mp make_pair
#define pb push_back
#define P pair<int,int>
#define ll __int64
int p,q;
vector<int>primes;

const int MA=10000000;
bool t[MA*2];

void eratosu(){
	t[1]=1;

	for(int i=2;i<=MA;i++){
		if(t[i]==0){
			primes.push_back(i);
			for(int j=i*2;j<=MA;j+=i)t[j]=1;
		}
	}
}

bool check(int x){
	int a=x;
	int aa=x;

	while(aa<=q){
		if(aa==q)return 1;
		aa=aa*a;
	}
	return 0;
}

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

for(int i=0;i<primes.size();i++){
	int now=primes[i];
	while(q%now==0&&p%now==0)q/=now,p/=now;
}

int ans=1,qq=q;
for(int i=0;i<primes.size();i++){
	int now=primes[i];

	if(q%now==0)ans*=now;
	while(q%now==0)q/=now;

	//if(now>sqrt(qq))break;
}
cout<<ans<<endl;
	return 0;
}

C++: #include<stdio.h>
#include<math.h>

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

bool judgeprime(int n){
    if(n == 1 || n % 2 == 0)
        return false;
    int  i,j;
    j = (int)sqrt(n) + 1;
    bool k = true;
    for(i = 3;i < j;i += 2)
        if(n % i == 0){
            k = false;
            break;
        }
    return k;
}

int nextprime(int prime){
    prime++;
    while(judgeprime(prime++) == false);
    return prime - 1;
}

int main(void){
    int p,q;
    scanf("%d%d",&p,&q);

    q /= gcd(p,q);

    int prime = 2,ans = 1;

    while(q > 1){
        if(q % prime == 0){
            ans *= prime;
            while(q % prime == 0)
                q /= prime;
        }
        if(judgeprime(q)){
            ans *= q;
            break;
        }
        prime = nextprime(prime);

    }
    printf("%d\n",ans);
    return 0;
}