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 <stdio.h>
#include <cmath>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
typedef long long int ll;
#define BIG_NUM 2000000000
using namespace std;

int main(){

	int p,q,pre_limit,limit;
	scanf("%d %d",&p,&q);

	pre_limit = sqrt(q);

	for(int i = 2; i <= pre_limit; i++){
		while(p%i == 0 && q %i == 0){
			p /= i;
			q /= i;
		}
	}

	if(q % p == 0)q /= p;

	limit = sqrt(q);

	int ans = 1;

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

	ans *= q;

	printf("%d\n",ans);

	return 0;
}

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

#include <cmath>
#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);
}

pair<uint32_t, uint32_t> nth_root(uint32_t n)
{
  for (uint32_t i = 2; i <= (uint32_t)sqrt(n); i++) {
    uint32_t tmp = n;
    uint32_t count = 0;
    while (tmp % i == 0) {
      tmp /= i;
      count++;
    }
    if (tmp == 1) {
      return {i, count};
    }
  }
  return {n, 1};
}

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

  uint32_t pp = p / g;
  uint32_t qq = q / g;

  cout << nth_root(qq).first << 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<=1000000000;i++){
	if(check(i)){
		cout<<i<<endl;	
		return 0;
	}
}
	return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;
#define lp(i,n) for(int i=0;i<n;i++)
#define fordebug int hoge;cin>>hoge;
int main(){
  int a,b;
  cin>>a>>b;
  while(1){
    int stat=0;
    for(int i=2;i<=sqrt(max(a,b));i++){
      if(a%i==0&&b%i==0){
	stat=1;
	a/=i;
	b/=i;
	break;
      }
    }
    if(stat==0) break;
  }
  if(b==1) b=2;
  cout<<b<<endl;
  return 0;
}

C++: import math
p, q = map(int, input().split())
g = math.gcd(p, q)
p //= g
q //= g
ret = q
for b in range(1, 40000):
    if b ** 1000 * p % q == 0:
        ret = min(ret, b)
print(ret)

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

// calculate |gcd|.
// if  ether num is 0, return 0
long long GCD(long long left, long long right) {
  if(left == 0 || right == 0) return 0;
  if(left < 0) left *= -1;
  if(right < 0) right *= -1;
  if(left < right) swap(left, right);
  long long nextnum, ansgcd = -1;
  while(ansgcd == -1) {
    nextnum = left % right;
    if(nextnum == 0) ansgcd = right;
    left = right;
    right = nextnum;
  }
  return ansgcd;
}

long long LCM(long long left, long long right) {
  return left / GCD(left, right) * right;
}

long long p, q;

long long solve();

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

  cout << solve() << endl;
  return 0;
}

long long solve() {
  long long now = q / GCD(p, q), ans = 1;
  for(long long i = 2; i * i <= now; ++i)
    if(now % i == 0) {
      ans *= i;
      while(now % i == 0) now /= i;
    }
  if(now > 1) ans *= now;
  return ans;
}

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