#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
bool is_prime(int n){//素数判定
    for(int i = 2; i * i < n; i++){
        if(n % i == 0) return false;
    }
    return n != 1;
}
int main(){
    long long N;
    cin >> N;
    if(N == 1){
        cout << 1 << endl;
        return 0;
    }
    N -= 1;
    long long M = 1e5 + 1;
    vector<long long> g;
    int c = 0;
    for(long long i = M;; i+=2){
        if(is_prime(i)) {
            g.push_back(i);
            c++;
        }
        if(c == 5) break;
    }
    vector<long long> t;
    for(long long i:g){
        for(long long j:g){
            t.push_back(i*j);
        }
    }
    sort(t.begin(), t.end());
    cout << t[N] << endl;
}