import java.util.*;

public class Euler124 {
    public static void main(String[] args) {
        int limit = 100000;
        int[] rad = new int[limit + 1];
        Arrays.fill(rad, 1);
        boolean[] isPrime = new boolean[limit + 1];
        Arrays.fill(isPrime, true);
        for (int p = 2; p <= limit; p++) {
            if (!isPrime[p])
                continue;
            for (int m = p; m <= limit; m += p) {
                rad[m] *= p;
                if (m > p)
                    isPrime[m] = false;
            }
        }
        Integer[] idx = new Integer[limit];
        for (int i = 0; i < limit; i++)
            idx[i] = i + 1;
        Arrays.sort(idx, (a, b) -> rad[a] != rad[b] ? rad[a] - rad[b] : a - b);
        System.out.println(idx[9999]);
    }
}