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

#ifdef LOCAL
#include "debug.h"
#else
#define DEBUG(...)
#endif

vector<int> sieve(int n) {
  vector<bool> b(n / 3 + 1, true);
  vector<int> res{2, 3};
  for (int p = 5, d = 4; p * p <= n; p += d = 6 - d) if (b[p / 3])
    for (int i = p * p, di = p % 3 * 2 * p; i <= n; i += di = 6 * p - di)
      b[i / 3] = false;
  for (int p = 5, d = 4; p <= n; p += d = 6 - d) if(b[p / 3]) res.push_back(p);
  while (not res.empty() and res.back() > n) res.pop_back();
  return res;
}

int main() {
  cin.tie(nullptr);
  ios::sync_with_stdio(false);
  auto ps = sieve(2e5);
  int s = lower_bound(begin(ps), end(ps), (int)1e5) - begin(ps);
  vector<long long> v;
  for (int bt = 0; bt < 1 << 10; ++bt) {
    if (__builtin_popcount(bt) >= 3) continue;
    if (__builtin_popcount(bt) == 1) continue;
    auto t = 1LL;
    for (int i = 0; i < 10; ++i) {
      if (bt >> i & 1) {
        t *= ps[s + i];
      }
    }
    v.push_back(t);
  }
  sort(begin(v), end(v));
  int n;
  cin >> n;
  --n;
  cout << v[n] << '\n';
}