import java.util.*;

public class Main {
    static final int MOD = 1000000007;
	public static void main (String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		TreeSet<Integer> primes = new TreeSet<>();
		int num = 100001;
		while (primes.size() < 10) {
		    if (isPrime(num)) {
		        primes.add(num);
		    }
		    num += 2;
		}
		TreeSet<Long> ans = new TreeSet<>();
		ans.add(1L);
		for (int x : primes) {
		    for (int y : primes) {
		        ans.add((long)x * y);
		    }
		}
		int idx = 1;
		for (long x : ans) {
		    if (idx == n) {
		        System.out.println(x);
		        return;
		    }
		    idx++;
		}
	}
	
	static boolean isPrime(int x) {
	    for (int i = 2; i <= Math.sqrt(x); i++) {
	        if (x % i == 0) {
	            return false;
	        }
	    }
	    return true;
	}
}