#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)n; i++)
using ll = long long;
const int MAX =2e5;

class Prime {
  vector<bool> is_prime;
  int n;
public:
  Prime(int n) : n(n) {
    is_prime.resize(n+1,true);
    is_prime[0] = is_prime[1] = false;
    for(int i = 2; i <= n; i++){
      if(is_prime[i]){
        for(int j = 2 * i; j <= n; j += i) is_prime[j] = false;
      }
    }
  }
  bool operator[](const int &k) const {
    return is_prime[k];
  }
};

int main(){
  int n;
  cin >> n;
  Prime p(MAX);
  if(n == 1) {
    cout << 1 << endl;
    return 0;
  }
  n--;
  vector<ll> v;
  ll k = 1e5+1;
  while(v.size() < n+1) {
    if(p[k]) v.push_back(k);
    k++;
  }
  vector<ll> a;
  rep(i,v.size()) {
    for(int j = i; j < v.size(); j++) a.push_back(v[i]*v[j]);
  }
  sort(a.begin(),a.end());
  cout << a[n-1] << endl;
  return 0;
}