#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <map>
#include <queue>
#include <iomanip>
#include <set>
#include <tuple>
#define mkp make_pair
#define mkt make_tuple
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
const ll MOD=1e9+7;
template<class T> void chmin(T &a,const T &b){if(a>b) a=b;}
template<class T> void chmax(T &a,const T &b){if(a<b) a=b;}

const int L=110000;
const int D=1e5;

int main(){
  cin.tie(0);
  ios::sync_with_stdio(false);

  int N;
  cin>>N;

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

  vector<int> isprime(L+1,1);
  vector<ll> primes;
  for(ll i=2;i<=L;i++){
    if(isprime[i]==0) continue;
    if(i>D) primes.push_back(i);
    for(ll j=2;i*j<=L;j++) isprime[i*j]=0;
  }
  N--;

  vector<ll> v;
  for(int i=0;i<primes.size();i++) for(int j=i;j<primes.size();j++) v.push_back(primes[i]*primes[j]);
  sort(v.begin(),v.end());
  cout<<v[N-1]<<endl;



  return 0;
}