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 std::cin;
using std::cout;
using std::endl;

int gcd(int n, int m) {
	if ( n%m == 0 ) {
		return m;
	}
	else {
		return gcd(m,n%m);
	}
}

int main(void) {
	int p,q;
	cin >> p >> q;
	int n = q;
	int m = p;
	int l = gcd(n,m);
	while ( l != 1 ) {
		n = n/l;
		m = m/l;
		l = gcd(n,m);
	}
	if ( (int)sqrt(n) == sqrt(n) ) {
		n = sqrt(n);
	}
	if ( (int)sqrt(n) == sqrt(n) ) {
		if ( q%2 == 0 ) {
			while ( n%2 != 1 ) {
				n = n/2;
			}
			cout << 2*n << endl;
		}
	}
	else {
		cout << n << endl;
	}
	return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b){
  if (b == 0){
    return a;
  } else {
    return gcd(b, a % b);
  }
}
int main(){
  int p, q;
  cin >> p >> q;
  int g = gcd(p, q);
  p /= g;
  q /= g;
  int ans = 1;
  for (int i = 2; i * i <= q; i++){
    if (q % i == 0){
      ans *= i;
      while (q % i == 0){
        q /= i;
      }
    }
  }
  if (q != 1){
    ans *= q;
  }
  cout << ans << endl;
}

C++: #include<iostream>
#include<vector>
#include<string>
#include<algorithm>	
#include<map>
#include<set>
#include<utility>
#include<cmath>
#include<cstring>
#include<queue>
#include<cstdio>
#include<sstream>
#include<iomanip>
#define loop(i,a,b) for(int i=a;i<b;i++) 
#define rep(i,a) loop(i,0,a)
#define pb push_back
#define mp make_pair
#define all(in) in.begin(),in.end()
#define shosu(x) fixed<<setprecision(x)
using namespace std;
//kaewasuretyuui
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vp;
typedef vector<vp> vvp;
typedef pair<int,pii> pip;
typedef vector<pip>vip;
const double PI=acos(-1);
const double EPS=1e-8;
const int inf=1<<30;
int gcd(int a,int b){
	return (b==0?a:gcd(b,a%b));
}
int main(){
	int a,b;
	cin>>a>>b;
	b/=gcd(a,b);
	bool h=false;
	for(int t=2;t*t<=b;t++){
		int r=b;
		while(r%t==0)r/=t;
		if(r==1){
			cout<<t<<endl;
			h=true;
			break;
		}
	}
	if(!h)cout<<b<<endl;
}

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

C++: #include<cstdio>

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

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

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

}

C++: #include<iostream>
using namespace std;
#define MAX 1e9
int main(){
  int p,q;
  cin>>p>>q;
  for(int i=2;i<MAX;i+=2){
    if(q%i==0&&p%(q/i)==0){
      cout<<i<<endl;
      break;
    }
    if(i==2)i--;
  }
  return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;
 
#define int long long
typedef pair<int,int>pint;
typedef vector<int>vint;
typedef vector<pint>vpint;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define reps(i,f,n) for(int i=(f);i<(n);i++)
#define each(it,v) for(__typeof((v).begin()) it=(v).begin();it!=(v).end();it++)
template<class T,class U>inline void chmin(T &t,U f){if(t>f)t=f;}
template<class T,class U>inline void chmax(T &t,U f){if(t<f)t=f;}
 
int gcd(int a,int b){
    return b?gcd(b,a%b):a;
}
 
signed main(){
    int p,q;
    cin>>p>>q;
    int g=gcd(p,q);
    q/=g;
    for(int i=2;i*i<=q;i++){
        if(q%i)continue;
        while(q%i==0)q/=i;
        q*=i;
    }
    cout<<q<<endl;
    return 0;
}

C++: #include <bits/stdc++.h>
#define REP(i,n) for (int i=0;i<(n);i++)
using namespace std;
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 r=gcd(q,p);
    p/=r;q/=r;
    int ans=1;
    for(int i=2;i*i<=q;i++){
        if(q%i!=0)continue;
        ans*=i;
        while(q%i==0)q/=i;
    }
    cout<<ans<<endl;
}