import java.math.BigInteger;
import java.util.ArrayList;

public class Euler881 {

    static int widthFromExponents(ArrayList<Integer> exps) {
        int[] poly = { 1 };
        for (int e : exps) {
            int[] nextPoly = new int[poly.length + e];
            for (int i = 0; i < poly.length; ++i) {
                int v = poly[i];
                for (int t = 0; t <= e; ++t) {
                    nextPoly[i + t] += v;
                }
            }
            poly = nextPoly;
        }
        int max = 0;
        for (int v : poly) {
            if (v > max)
                max = v;
        }
        return max;
    }

    static class Solver {
        static final int TARGET = 10000;
        int[] primes = { 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61 };
        BigInteger best;

        Solver() {
            best = BigInteger.ONE;
            for (int i = 0; i < 16; ++i) {
                best = best.multiply(BigInteger.valueOf(primes[i]));
            }
        }

        void dfs(int pos, int maxExp, BigInteger n, ArrayList<Integer> exps) {
            int w = widthFromExponents(exps);
            if (w >= TARGET) {
                if (n.compareTo(best) < 0) {
                    best = n;
                }
                return;
            }
            if (pos >= primes.length)
                return;

            BigInteger mult = BigInteger.ONE;
            BigInteger p = BigInteger.valueOf(primes[pos]);
            for (int e = 1; e <= maxExp; ++e) {
                mult = mult.multiply(p);
                BigInteger n2 = n.multiply(mult);
                if (n2.compareTo(best) >= 0)
                    break;
                exps.add(e);
                dfs(pos + 1, e, n2, exps);
                exps.remove(exps.size() - 1);
            }
        }

        BigInteger solve() {
            ArrayList<Integer> exps = new ArrayList<>();
            dfs(0, 64, BigInteger.ONE, exps);
            return best;
        }
    }

    public static String solve() {
        Solver solver = new Solver();
        return solver.solve().toString();
    }

    public static void main(String[] args) {
        System.out.println(solve());
    }
}