Given the number n, find the smallest positive integer which has exactly n divisors. It is guaranteed that for the given n the answer will not exceed 1018.

Input

The first line of the input contains integer n (1 ≤ n ≤ 1000).

Output

Output the smallest positive integer with exactly n divisors.

Examples

Input

4


Output

6


Input

6


Output

12


import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.*;

/**
 * Created by STay on 6/4/17.
 */
public class Main {
    static InputStream is;
    static PrintWriter out;
    static String INPUT = "";

    static BigInteger ans;
    static boolean fg = true;
    static int prime[] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31};
    static int v[] = new int[100];
    static int n;
    static int ind;


    static void solve() {
        BigInteger temp = BigInteger.ONE;
        int cnt = 0;
        for (int i = ind - 1; i >= 0; i--) {
            for (int j = 0; j < v[i]; j++) {
                temp = temp.multiply(BigInteger.valueOf(prime[cnt]));
            }
            cnt++;
        }
        if (fg == true) {
            ans = temp;
            fg = false;
        }
        if (temp.compareTo(ans) < 0) {
            ans = temp;
        }

    }
    static void dfs(int pos) {
        if (n == 1) solve();
        for (int i = pos; i <= n; i++) {
            if (n % i == 0) {
                n /= i;
                v[ind++] = i - 1;
                dfs(i);
                ind--;
                n *= i;
            }
        }
    }
    public static void main(String[] args) throws Exception {
        Scanner cin = new Scanner(System.in);

        n = cin.nextInt();
        ind = 0;
        dfs(2);
        System.out.println(ans);
    }

    private static boolean eof() {
        if (lenbuf == -1) return true;
        int lptr = ptrbuf;
        while (lptr < lenbuf) if (!isSpaceChar(inbuf[lptr++])) return false;

        try {
            is.mark(1000);
            while (true) {
                int b = is.read();
                if (b == -1) {
                    is.reset();
                    return true;
                } else if (!isSpaceChar(b)) {
                    is.reset();
                    return false;
                }
            }
        } catch (IOException e) {
            return true;
        }
    }

    private static byte[] inbuf = new byte[1024];
    static int lenbuf = 0, ptrbuf = 0;

    private static int readByte() {
        if (lenbuf == -1) throw new InputMismatchException();
        if (ptrbuf >= lenbuf) {
            ptrbuf = 0;
            try {
                lenbuf = is.read(inbuf);
            } catch (IOException e) {
                throw new InputMismatchException();
            }
            if (lenbuf <= 0) return -1;
        }
        return inbuf[ptrbuf++];
    }

    private static boolean isSpaceChar(int c) {
        return !(c >= 33 && c <= 126);
    }

    private static int skip() {
        int b;
        while ((b = readByte()) != -1 && isSpaceChar(b)) ;
        return b;
    }

    //输入double
    private static double nd() {
        return Double.parseDouble(ns());
    }

    //输入char
    private static char nc() {
        return (char) skip();
    }

    //输入一个String
    private static String ns() {
        int b = skip();
        StringBuilder sb = new StringBuilder();
        while (!(isSpaceChar(b))) { // when nextLine, (isSpaceChar(b) && b != ' ')
            sb.appendCodePoint(b);
            b = readByte();
        }
        return sb.toString();
    }

    //输入一个char数组
    private static char[] ns(int n) {
        char[] buf = new char[n];
        int b = skip(), p = 0;
        while (p < n && !(isSpaceChar(b))) {
            buf[p++] = (char) b;
            b = readByte();
        }
        return n == p ? buf : Arrays.copyOf(buf, p);
    }

    //输入一个矩阵
    private static char[][] nm(int n, int m) {
        char[][] map = new char[n][];
        for (int i = 0; i < n; i++) map[i] = ns(m);
        return map;
    }

    //输入一个输入n整数
    private static int[] na(int n) {
        int[] a = new int[n];
        for (int i = 0; i < n; i++) a[i] = ni();
        return a;
    }

    //输入一个整数
    private static int ni() {
        int num = 0, b;
        boolean minus = false;
        while ((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-')) ;
        if (b == '-') {
            minus = true;
            b = readByte();
        }

        while (true) {
            if (b >= '0' && b <= '9') {
                num = num * 10 + (b - '0');
            } else {
                return minus ? -num : num;
            }
            b = readByte();
        }
    }

    //输入一个long
    private static long nl() {
        long num = 0;
        int b;
        boolean minus = false;
        while ((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-')) ;
        if (b == '-') {
            minus = true;
            b = readByte();
        }

        while (true) {
            if (b >= '0' && b <= '9') {
                num = num * 10 + (b - '0');
            } else {
                return minus ? -num : num;
            }
            b = readByte();
        }
    }


    private static void tr(Object... o) {
        if (INPUT.length() != 0) System.out.println(Arrays.deepToString(o));
    }
}


  		 	 	 		 	 	 	 			  			 			