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<set>
#include<string>
#include<algorithm>
#include<vector>

using namespace std;


int p,q;
vector<int> yakusuu;


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

  for(int i=1;i<=p/2;i++){
    if(p%i==0){
      yakusuu.push_back(i);
    }
  }

  for(int j=0;j<yakusuu.size();j++){
    if(q%yakusuu[j]==0) q=q/yakusuu[j];
  }

  cout<<q<<endl;
 
  
  return 0;
}

C++: #include <iostream>
using namespace std;

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

int P, Q;

int main() {
    cin >> P >> Q;
    int v = Q / gcd(P, Q);
    for (int d = 2; d*d <= v; ++d) {
        if (v % d == 0) {
            while ((v/d)%d == 0) { v /= d; }
        }
    }
    cout << max(2, v) << endl;
}

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;
	q /= GCD(p, q);
	int ans = q;
	map<int, int> mpa;
	for(int i = 2; i * i <= q; i++){
		while(q % i == 0){
			mpa[i]++;
			q /= i;
		}
	}
	if(q != 1) mpa[q]++;
	map<int, int>::iterator it;
	if(mpa.size() == 1) ans = mpa.begin()->first;
	else{
		int pow = mpa.begin()->first;
		for(it = mpa.begin(); it != mpa.end(); it++){
			if(it == mpa.begin()) continue;
			pow = GCD(pow, it->second);
		}
		if(pow >= 2){
			int num = 1;
			for(it = mpa.begin(); it != mpa.end(); it++){
				for(int i = 1; i <= it->second / pow; i++){
					num *= it->first;
				}
			}
			ans = num;
		}
	}
	cout << ans << endl;
	return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;
int main(){
        long long p,q;
        cin >> p >> q;
        for(long long i=2;i*i<=q;i++){
                if(p%i==0&&q%i==0){
                        do{
                                p/=i;
                                q/=i;
                        }
                        while(p%i==0&&q%i==0);
                }
        }
        for(int i=2;i*i<=q;i++){
                if((int)pow(p,0.5)==(double)pow(p,0.5)&&(int)pow(q,0.5)==(double)pow(q,0.5)){
                	p/=pow(p,0.5);
                	q/=pow(q,0.5);
                }
        }
        cout << q << endl;
        return 0;
}

C++: #include <iostream>
#include<cstdlib>
#include<queue>
#include<set>
#include<vector>
#include<string>
#include<algorithm>
#include<sstream>
#include<cmath>
#include<stack>
#include<map>
#include<cstdio>
using namespace std;
#define rep(i,a) for(int i=0;i<a;i++)
#define mp make_pair
#define pb push_back
#define P pair<int,int>
#define ll __int64
int p,q;
vector<int>primes;

const int MA=10000000;
bool t[MA*2];

void eratosu(){
	t[1]=1;

	for(int i=2;i<=MA;i++){
		if(t[i]==0){
			primes.push_back(i);
			for(int j=i*2;j<=MA;j+=i)t[j]=1;
		}
	}
}

bool check(int x){
	int a=x;
	int aa=x;

	while(aa<=q){
		if(aa==q)return 1;
		aa=aa*a;
	}
	return 0;
}

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

for(int i=0;i<primes.size();i++){
	int now=primes[i];
	//cout<<i<<endl;
	if(sqrt(now)>p||sqrt(now)>q)break;
	while(p%now==0&&q%now==0)p/=now,q/=now;
}
//cout<<p<<" "<<q<<endl;

for(int i=2;i<=10000;i++){
	if(check(i)){
		cout<<i<<endl;	
		break;
	}
}
cout<<"WA";
	return 0;
}

C++: #include <iostream>
#include <vector>
using namespace std;

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

int main() {
    vector<int> prime;
    vector<bool> is_prime(1e5, true);
    is_prime[0] = is_prime[1] = false;
    for(int i=2; i<1e5; ++i) {
        if(is_prime[i]) {
            prime.push_back(i);
            for(int j=i+i; j<100000; j+=i) {
                is_prime[j] = false;
            }
        }
    }
    int p, q;
    cin >> p >> q;
    int g = gcd(p, q);
    p /= g, q /= g;
    int ans = 1;
    for(int i=0; i<prime.size(); ++i) {
        if(q % prime[i] == 0) {
            ans *= prime[i];
            while(q % prime[i] == 0) {
                q /= prime[i];
            }
        }
    }
    if(q / ans > 1) {
        cout << q * ans << endl;
    } else {
        cout << ans << endl;
    }
}