#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
#define rep(i,s,e) for(i64 (i) = (s);(i) < (e);(i)++)
#define all(x) x.begin(),x.end()

template<class T>
static inline std::vector<T> ndvec(size_t&& n, T val) noexcept {
  return std::vector<T>(n, std::forward<T>(val));
}

template<class... Tail>
static inline auto ndvec(size_t&& n, Tail&&... tail) noexcept {
  return std::vector<decltype(ndvec(std::forward<Tail>(tail)...))>(n, ndvec(std::forward<Tail>(tail)...));
}

template<class T, class Cond>
struct chain {
  Cond cond; chain(Cond cond) : cond(cond) {}
  bool operator()(T& a, const T& b) const {
    if(cond(a, b)) { a = b; return true; }
    return false;
  }
};
template<class T, class Cond>
chain<T, Cond> make_chain(Cond cond) { return chain<T, Cond>(cond); }

int main() {
  std::vector<i64> primes;
  std::vector<bool> isp(202020, true);
  rep(i,2,202020) {
    if(isp[i]) {
      if(i > (i64)(1e5)) {
        primes.push_back(i);
        if(primes.size() >= 10) break;
      }
      for(int j = i + i; j < 202020; j += i) {
        isp[j] = false;
      }
    }
  }

  std::vector<i64> vec;
  vec.push_back(1);
  rep(i,0,10) {
    rep(j,i,10) {
      vec.push_back(primes[i] * primes[j]);
    }
  }

  sort(all(vec));
  int N;
  cin >> N;
  cout << vec[N - 1] << endl;
}