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>
using namespace std;
int main(){
  int p,q,x;
  cin>>p>>q;
  if(p<q) swap(p,q);
  int a=p;
  while(1){
    if(p%q!=0){
      x=p%q;
      p=q;
      q=x;
      continue;
    }
    break;
  }
  cout<<a/q<<endl;
  return 0;
}

C++: #include <algorithm>
#include <iostream>
#include <map>
#include <numeric>
#include <vector>
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n) for (int i=0;i<(n);i++)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)

using namespace std;
using lli = long long int;

lli gcd(lli x, lli y) {
  return (y == 0 ? x : gcd(y, x % y));
}

lli solve(lli p, lli q) {
  const lli NMAX = 100008;
  vector<lli> factor(NMAX, 0);
  for (lli n = 2; n < NMAX; ++n) {
    if (factor[n]) { continue; }
    for (lli k = 2; k * n < NMAX; ++k) {
      factor[k * n] = n;
    }
  }
  lli ans = 1;
  for (lli n = 2; q > 1 && n < NMAX; ++n) {
    if (factor[n] || (q % n != 0)) { continue; }
    while (q % n == 0) { q /= n; }
    ans *= n;
  }
  ans *= q;
  return max<lli>(2, ans);
}

int main() {
  lli P, Q; cin >> P >> Q;
  const lli G = gcd(P, Q);
  P /= G, Q /= G;
  cout << solve(P, Q) << endl;
  return 0;
}

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

int main(){
  int p,q;
  cin>>p>>q;
  int a=__gcd(p,q);
  p/=a,q/=a;

  for(int i=2;i*i<=q;i++){
    if(q%i!=0)continue;
    while((q/i)%i==0)q/=i;
    while((q/(q/i))%(q/i)==0)q/=(q/i);
  }
  cout <<q<<endl;  

  return 0;
}

C++: //http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1180
#include <iostream>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <cmath>
#include <algorithm>
#include <iomanip>
#include <queue>
using ll = long long;
using namespace std;

int const MOD = 1e9 + 7;

int GCD(int x, int y)
{
    if (y == 0)
        return x;
    return GCD(y, x % y);
}
int main(void)
{
    ll p, q;
    cin >> p >> q;

    int d = GCD(p, q);
    p /= d;
    q /= d;

    int ans = 1;
    for (int i = 2; i <= sqrt(q); ++i)
    {
        if (q % i == 0)
        {
            ans *= i;
            while (1)
            {
                if (q % i != 0)
                    break;
                q /= i;
            }
        }
    }
    ans *= q;
    cout << ans << endl;
    return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll a,b;
int main(){
  cin>>a>>b;
  b/=__gcd(a,b);
  ll x=b;
  ll ans=1;
  map<ll,bool> mp;
  for(ll i=2;i*i<=b;i++){
    while(x%i==0){
      if(!mp[i])ans*=i;
      mp[i]=true;
      x/=i;
    }
  }
  if(x>1)ans*=x;
  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)

using ll = long long;
int main(){
    ll p,q;
    while(cin >> p >> q){
        ll ans = 1;
        for(int i = 2; i <= 1e5; ++i){
            int c = 0;
            while(p%i == 0) p/=i, ++c;
            while(q%i == 0) q/=i, --c;
            if(c < 0) ans *= i;
        }
        cout << ans << endl;
    }
}

C++: //http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1180
#include <iostream>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <cmath>
#include <algorithm>
#include <iomanip>
#include <queue>
using ll = long long;
using namespace std;

int const MOD = 1e9 + 7;

int GCD(int x, int y)
{
    if (y == 0)
        return x;
    return GCD(y, x % y);
}
int main(void)
{
    ll p, q;
    cin >> p >> q;

    int d = GCD(p, q);
    p /= d;
    q /= d;

    map<ll, ll> mp;
    for (ll i = 2; i < 10000; ++i)
    {

        for (ll j = 2;; ++j)
        {

            if (pow(i, j) > 1e9)
                break;
            mp[pow(i, j)] = i;
        }
    }
    if (mp[q] == 0)
        cout << q << endl;
    else
        cout << mp[q] << endl;
    return 0;
}