#include "bits/stdc++.h"
using namespace std;

#define int long long
vector<int> a;

void solve(){
    int n;
    cin >> n;
    assert(n >= 1 and n <= 5e5);
    if (n == 1) {
        cout << "1\n";
        return;
    }
    cout << a[n - 2] << "\n";
}   

signed main(){
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    vector<int> primes;
    for (int i = 1e5 + 1; ; i++) {
        int ok = 1;
        for (int j = 2; j * j <= i; j++) {
            if (i % j == 0) {
                ok = 0;
                break;
            }
        }
        if (ok) primes.push_back(i);
        if (primes.size() >= 1001) break;
    }
    int ok = 1;
    for (int i = 0; i < primes.size(); i++) {
        for (int j = i; j < primes.size(); j++) {
            int x = primes[i] * primes[j];
            a.push_back(x);
        }
        if (!ok) break;
    }
    sort(a.begin(), a.end());
    // a.erase(unique(a.begin(), a.end()), a.end());
    int T = 1;
    // cin >> T;
    while(T--) solve();

    return 0;
}