#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <cmath>
using namespace std;
using ll = long long;

constexpr int K = (int)1e5;

struct Sieve {
    Sieve(int n) : l(n + 1, 0) {
        for (int i = 2; i <= n; i++) {
            if (!l[i]) p.push_back(l[i] = i);
            for (int q : p) {
                if (q > l[i]) break;
                if (int j = i * q; j <= n) l[j] = q; else break;
            }
        }
    }
    bool is_prime(int i) {
        return l[i] == i;
    }
    void solve() {
        int n;
        cin >> n;

        n--;
        if (n == 0) {
            cout << 1 << endl;
            exit(0);
        }

        int m = n;

        vector<int> a;
        for (int i = K + 1;; i++) {
            if (is_prime(i)) {
                a.push_back(i);
                if (--m == 0) break;
            }
        }

        vector<ll> b;
        for (int i = 0; i < n; i++) {
            for (int j = 0; j <= i; j++) {
                b.push_back((ll)a[i] * a[j]);
            }
        }
        sort(b.begin(), b.end());

        cout << b[n - 1] << endl;
    }
    vector<int> l, p;
};

int main() {
    Sieve si(K * 2);

    si.solve();

    return 0;
}