#include <cstdio>
#include <climits>
#include <cmath>
#include <iostream>
#include <iomanip>
#include <string>
#include <cstdio>
#include <climits>
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <utility>
#include <queue>
#include <cstring>
#include <set>
#include <map>
#include <complex>
#include <tuple>

#define rep(i, n) for (int i = 0; i < int(n); i++)
using namespace std;
long long MOD = 1000000007;
long long INF = 1000000000000000000; //10^18
typedef long long ll;
typedef unsigned long long ull;


ll powMod(ll x, ll n, ll mod) {
  if (n == 0) return 1;
  ll t = powMod(x, n/2, mod);
  t = t * t % mod;
  if (n & 1) return t * x % mod;
  return t;
}

ll gcd(ll a, ll b) {
  if (a == 0 || b == 0) return a + b;
  if (b > a) return gcd(b, a);
  return gcd(b, a % b);
}




int main(void) {

  int n;
  cin >> n;

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

  vector<bool> c(130000, true);

  for (int i = 2; i < 130000; i++) {
    if (c[i]) {
      for (int j = 2; i*j < 130000; j++) {
	c[i*j] = false;
      }
    }
  }

  vector<ll> p;
  for (int i = 100000; i < 130000; i++) {
    if (c[i]) p.push_back(i);
  }

  vector<ll> a;
  for (int i = 0; i < p.size(); i++) {
    for (int j = i; j < p.size(); j++) {
      a.push_back(p[i]*p[j]);
    }
  }

  a.push_back(1);

  sort(a.begin(), a.end());

  cout << a[n-1] << endl;
}