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>
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define ALL(x) x.begin(), x.end()
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
using namespace std;
using ll = long long;
using lld = long double;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;
using PII = pair<int, int>;
random_device rnd;
mt19937 mt(rnd());

const int IINF = 1 << 30;
const ll INF = 1ll << 60;
const ll MOD = 1e9 + 7;
int gcd(int a, int b)
{
    if (b == 0)
        return a;
    return gcd(b, a % b);
}

int main()
{
    int p, q;
    cin >> p >> q;
    int tmp = q / gcd(p, q);
    int ans = 1;
    int cur = 2;

    while (cur * cur <= tmp)
    {
        if (tmp % cur == 0)
        {
            ans *= cur;
            while (tmp % cur == 0)
                tmp /= cur;
        }
        cur++;
    }
    ans *= tmp;
    cout << ans << endl;

    return 0;
}

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

using namespace std;

int Prime[100000]={};

void pr(){
  Prime[0]=2;
  int tmp=1,num=1;
  while(num<100000){
    num+=2;
    int flag=0;
    for(int i=3;i<=sqrt(num);i+=2)
      if(num%i==0) flag++;
    if(flag==0) Prime[tmp++]=num;
  }
}

int gcd(int x,int y){
  return y?gcd(y,x%y):x;
}

int main(){
  pr();
  int p,q; cin>>p>>q;
  int a=q/gcd(p,q);
  //while(sqrt(a)*sqrt(a)==a) a=sqrt(a);
  for(int i=0;a/Prime[i]>=Prime[i];++i){
    int tmp=a;
    while(a%Prime[i]==0) a=a/Prime[i];
    if(tmp!=a) a*=Prime[i];
  }
  cout << a << endl;

  
  return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
	int p,q;
	cin>>p>>q;
	p=q/__gcd(p,q);
	for(int i=2;i*i<=p;i++){
		if(p%i)continue;
		int t=p;
		while(t%i==0)t/=i;
		if(t==1){
			cout<<i<<endl;
			return 0;
		}
	}
	cout<<p<<endl;
	return 0;
}

C++: 
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<math.h>
#include<string>
#include<string.h>
#include<stack>
#include<queue>
#include<vector>
#include<utility>
#include<set>
#include<map>
#include<stdlib.h>
#include<iomanip>

using namespace std;

#define ll long long
#define ld long double
#define EPS 0.0000000001
#define INF 1e9
#define MOD 1000000007
#define rep(i,n) for(i=0;i<n;i++)
#define loop(i,a,n) for(i=a;i<n;i++)
#define all(in) in.begin(),in.end()
#define shosu(x) fixed<<setprecision(x)

typedef vector<int> vi;
typedef pair<int,int> pii;

int main(void) {
  int i,j;
  int p,q;
  cin>>p>>q;
  int g=__gcd(p,q);
  q=q/g;

  vector<bool> prime(100000,true);
  loop(i,2,100000)
    if(prime[i])
      for(j=2;i*j<=100000;j++)
	prime[i*j]=false;
  prime[0]=prime[1]=false;

  ll ans=1;
  loop(i,1,q+1){
    if(prime[i]&&q%i==0)ans*=i;
  }
  cout<<ans<<endl;
}

C++: #include<bits/stdc++.h>
using namespace std;
int main(){
	long long p,q;
	cin >> p >> q;
	long long P=p,Q=q;
	while(p%q!=0){
		p=p%q;
		swap(p,q);
	}
	long long va=Q;
	//cout << q << endl;
	P/=q;
	Q/=q;
	for(long long i=2;i*i<=va;i++){
		va=Q;
		int count=0;
		while(Q%i==0){

			count++;
			Q/=i;
		}
		if(count==2){
			va/=i;

		}
		Q=va;
	}
	cout << Q << endl;
	return 0;
}

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

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

        }
        res*=q;
        cout<<res<<endl;
        return 0;
    }

}