#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3fLL;
const double EPS = 1e-8;
const int MOD = 1000000007;
// const int MOD = 998244353;
const int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
const int dy8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx8[] = {0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    cout << fixed << setprecision(20);
  }
} iosetup;

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

int main() {
  int n; cin >> n;
  if (n == 1) {
    cout << "1\n";
    return 0;
  }
  --n;
  vector<ll> v;
  FOR(i, 100001, 100100) FOR(j, 100001, 100100) {
    if (is_prime(i) && is_prime(j)) v.emplace_back(1LL * i * j);
  }
  sort(ALL(v));
  v.erase(unique(ALL(v)), v.end());
  cout << v[n - 1] << '\n';
  return 0;
}