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>
int gcd(int a, int b) {
    if(b == 0) return a;
    else return gcd(b, a%b);
}
int main() {
    int p, q; scanf("%d%d", &p, &q);
    int x = gcd(q, p); p /= x; q/= x;
    bool ok = true;
    for(int i=2; i<=sqrt(q); i++) {
        int m = q;
        while(!(m % i)) m /= i;
        if(m == 1) {printf("%d\n", i); ok = false; break;}
    }
    if(ok) printf("%d\n", q);
}

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

int main(){
  int p,q,t,ans;
  cin>>p>>q;
  ans=t=q/__gcd(p,q);
  for(int i=2;i*i<=t;i++)
    if(!(t%i))ans=i;
  cout<<ans<<endl;
  return 0;
}

C++: #include<iostream>
#include<vector>
#include<queue>
using namespace std;
#define N 1000000000
typedef long long int ll;
ll gcd(ll a,ll b){
if(b==0)return a;
else return gcd(b,a%b);

}
vector<bool> prime(N+1,true);
void make(ll M){
	prime[0]=prime[1]=false;
	for(ll i=2;i*i<M+1;i++){
	if(prime[i]){
		ll j=2;
	while(i*j<M+1){
	prime[i*j]=false;
	j++;
		}

	}

	}
return;

}
int main(){
ll a,b;
//cout<<"ok"<<endl;

cin>>a>>b;
make(max(a,b));
//cout<<"ok"<<endl;
//cout<<b/gcd(a,b)<<endl;
ll c=b/gcd(a,b);
//cout<<c<<endl;
ll ans = 1;
for(ll i=2;i<=max(a,b);i++){
if(prime[i]&&c%i==0){
	ans*=i;
}

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

}

C++: #include <stdio.h>

int gcd(int a, int b) {
  int t;
  while(b) {
    t = a % b;
    a = b;
    b = t;
  }
  return a;
}

int main(void){
  int a, b;
  scanf("%d%d", &a, &b);
  printf("%d\n", b / gcd(a, b));
  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;
  while(1){
    int a=sqrt(q);
    if(a*a==q)q=sqrt(q);
    else break;
  }
  cout<<q<<endl;
}

C++: #include<bits/stdc++.h>
using namespace std;
int main(){
  int q,p,t,ans=1,i,j,c;
  cin>>q>>p;t=p;
  p/=__gcd(q,p);
  if(p%3==0)ans*=3;
  if(p%2==0)ans*=2;
  for(i=5;i*i<=t;i++)
    if(p%i==0)ans*=i;
  if(ans==1&&q!=t)ans=t;
  cout<<ans<<endl;
}

C++: ///
// File:  2706.cpp
// Author: ymiyamoto
//
// Created on Sat Dec  2 22:06:52 2017
//

#include <cstdint>
#include <iostream>

using namespace std;

uint32_t gcd(uint32_t p, uint32_t q)
{
  if (q > p) return gcd(q, p);
  if (q == 0)
    return p;
  else
    return gcd(q, p % q);
}

int32_t main()
{
  uint32_t p, q;
  cin >> p >> q;
  uint32_t g = gcd(p, q);

  uint32_t qq = q / g;
  for (uint32_t i = 2; i < q / g; i++) {
    if (qq % i == 0) {
      cout << i << endl;
      break;
    }
  }

  return 0;
}

C++: #include <iostream>
#include <vector>
using namespace	std;
int main(){

  int p,q,use;
  int so[40000]={0};

  cin>>p>>q;
  use=q;
  int a;
  while(q%p!=0){
    a=q%p;
    q=p;
    p=a;
  }
  use/=p;
  q=use;
  vector <int> sonaka;
  for(int i=2;i<20000;i++) if(so[i]==0){
      sonaka.push_back(i);
      for(int j=i*2;j<40000;j+=i) so[j]=1;
    }
  int result=1;
  for(int i=0;sonaka[i]<=use&&i<sonaka.size();i++){
    if(use%sonaka[i]==0){
      result*=sonaka[i];
      while(use%sonaka[i]==0) use/=sonaka[i];
    }
  }

  cout<<result*use<<endl;
  return 0;
}