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>
using namespace std;
unsigned gcd(unsigned a, unsigned b) {
  if(a < b) return gcd(b, a);
  unsigned r;
  while ((r=a%b)) {
    a = b;
    b = r;
  }
  return b;
}
int main(){
  long long p,q,t=1,gc;
  cin >> p >> q;
  gc = gcd(p,q);
  p /= gc;
  q /= gc;
  for(int i=2;i*i<=q;i++){
    if(q%i==0){
      t*=i;
      while(q%i==0) q/=i;
    }
  }
  t*=q;
  cout << t << endl;
}

C++: #include<bits/stdc++.h>
#define range(i,a,b) for(int i = (a); i < (b); i++)
#define rep(i,b) for(int i = 0; i < (b); i++)
#define all(a) (a).begin(), (a).end()
#define debug(x) cout << "debug " << x << endl;
const int INF = 100000000;
using namespace std;


//?????§??¬?´???°
int gcd(int x, int y) {
    int r;
    if(x < y) swap(x, y);

    while(y > 0){
        r = x % y;
        x = y;
        y = r;
    }
    return x;
}

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

    q/= gcd(p, q);

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

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

C++: #include<bits/stdc++.h>
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);

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

	}

	}
/*	for(;i<=M;i++){
		if(prime[i])q.push(i);
	}*/
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;
ll ma = c;
while(!q.empty()){
	ll d = q.front();
//	cout<<d<<endl;
if(c%d==0){
	while(c%d==0)c/=d;
	ans*=d;
}
q.pop();
}
/*for(ll i=2;i<=c;i++){
if(c%i==0){
	
	ans*=i;
	//cout<<i<<endl;
	while(c%i==0)c/=i;
	//cout<<i<<' '<<c<<' '<<ma<<endl;
}

}*/
//cout<<c<<endl;
ans*=c;
cout<<ans<<endl;
return 0;

}

C++: #include <bits/stdc++.h>
#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[100000000];
vector<int> v;

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

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

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

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

C++: #include <bits/stdc++.h>
#define rep(i, a, n) for(int i = a; i < n; i++)
#define repb(i, a, b) for(int i = a; i >= b; i--)
#define all(a) a.begin(), a.end()
#define o(a) cout << a << endl
#define int long long
#define first fi;
#define second se;
using namespace std;
typedef pair<int, int> P;

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

signed main(){
    int p, q;
    cin >> p >> q;
    cout << max((int)2, q / gcd(p, q)) << endl;
}

C++: #include<bits/stdc++.h>
#define range(i,a,b) for(int i = (a); i < (b); i++)
#define rep(i,b) for(int i = 0; i < (b); i++)
#define all(a) (a).begin(), (a).end()
#define debug(x) cout << "debug " << x << endl;
const int INF = 100000000;
using namespace std;


//?????§??¬?´???°
int gcd(int x, int y) {
    int r;
    if(x < y) swap(x, y);

    while(y > 0){
        r = x % y;
        x = y;
        y = r;
    }
    return x;
}

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

    q/= gcd(p, q);

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