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.*;
import java.math.BigInteger;
import java.util.*;

public class Main {
	static ArrayList<Integer> list = null;
	static TreeSet<ArrayList<Integer>> resSet = null;
	static int n;
	public static void main(String[] args) throws Exception {
		PrintWriter pr = new PrintWriter(System.out, true);
		BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
		// Scanner s = new Scanner(System.in);
		// StringTokenizer st = new StringTokenizer(in.readLine());
		n = Integer.parseInt(in.readLine());
		list = new ArrayList<Integer>(10);
		resSet = new TreeSet<ArrayList<Integer>>(new Comparator<ArrayList<Integer>>() {
			@Override
			public int compare(ArrayList<Integer> a1, ArrayList<Integer> a2) {
				if(a1.equals(a2)) {
					return 0;
				}
				return 1;
			}
			
		});
		list.add(n);
		func();
		int[] prime = {2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97,101,103,107,109,113,127,131,137,139,149,151,157,163,167,173,179,181,191,193,197,199,211,223,227,229,233,239,241,251,257,263,269,271,277,281,283,293,307,311,313,317,331,337,347,349,353,359,367,373,379,383,389,397,401,409,419,421,431,433,439,443,449,457,461,463,467,479,487,491,499,503,509,521,523,541,547,557,563,569,571,577,587,593,599,601,607,613,617,619,631,641,643,647,653,659,661,673,677,683,691,701,709,719,727,733,739,743,751,757,761,769,773,787,797,809,811,821,823,827,829,839,853,857,859,863,877,881,883,887,907,911,919,929,937,941,947,953,967,971,977,983,991,997};
		long res = Long.MAX_VALUE;
		long tmp = 1;
		for(ArrayList<Integer> l : resSet) {
			tmp = 1;
			//pr.println(l);
			for(int i = 0;i < l.size();i++) {
				tmp *= Math.pow(prime[i], l.get(i)-1);
				if(tmp > 1000000000000000000L || tmp < 0) {
					tmp = Long.MAX_VALUE;
					break;
				}
			}
			res = Math.min(res, tmp);
		}
		pr.println(res);
	}
	
	public static void func() {
		int k = list.get(list.size()-1);
		boolean is = false;
		for(int i = k-1; i > 1;i--) {
			if(k % i == 0) {
				list.add(k/i);
				func();
				list.remove(list.size()-1);
				is = true;
			}
		}
		if(!is) {
			ArrayList<Integer> l = new ArrayList<Integer>(list);
			for(int i = 0;i < l.size()-1;i++) {
				l.set(i, l.get(i)/l.get(i+1));
			}
			Collections.sort(l);
			Collections.reverse(l);
			resSet.add(l);
		}
	}
	
} 