#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repr(i, n) for (int i = (n) - 1; i >= 0; i--)
#define range(a) a.begin(), a.end()

bool is_prime(ll n) {
    for (ll i = 2; i * i <= n; i++) {
        if (n % i == 0) return false;
    }
    return n != 1;
}

int main() {
    vector<ll> P;
    for (ll i = 100001; P.size() <= 10; i++) {
        if (is_prime(i)) {
            P.push_back(i);
        }
    }
    vector<ll> Q;
    Q.push_back(1);
    rep(i, P.size()) rep(j, i + 1) Q.push_back(P[i] * P[j]);
    sort(range(Q));
    int n; cin >> n;
    cout << Q[n - 1] << endl;
}