import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;
import java.util.TreeSet;

public class Main {
	public static void main(String[] args) throws Exception {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		sc.close();

		if (n == 1) {
			System.out.println(1);
		} else {
			List<Long> list = new ArrayList<>();
			int cnt = 1;
			for (long i = 100001; ; i++) {
				if (isSosuu(i)) {
					list.add(i);
					cnt++;
					if (cnt == n) {
						break;
					}
				}
			}
			TreeSet<Long> set = new TreeSet<>();
			for (int i = 0; i < list.size(); i++) {
				for (int j = 0; j < list.size(); j++) {
					set.add(list.get(i) * list.get(j));
				}
			}
			for (int i = 0; i < n - 2; i++) {
				set.pollFirst();
			}
			System.out.println(set.pollFirst());
		}
	}

	static boolean isSosuu(long n) {
		if (n < 2) return false;
		if (n == 2) return true;
		long end = (int) Math.sqrt(n) + 1;
		for (int i = 2; i <= end; i++) {
			if (n % i == 0) {
				return false;
			}
		}
		return true;
	}
}