//#include <atcoder/all>
#include <iostream>
#include <numeric>
#include <cmath>
#include <limits>
#include <stdio.h>
#include <iomanip>
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tuple> // tuple, make_tuple
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <map> // map
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <deque> // deque
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
using namespace std;
//using namespace atcoder;
using ll = long long;
#define all(A) A.begin(),A.end()
using vll = vector<ll>;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
using Graph = vector<vector<pair<ll, ll>>>;
ll N,B,K;
ll mod=1e9+7;
vll C;

char tr(char C){
    if(C>'a'){
        return (C-'a'+'A');
    }
   else{
       return (C-'A'+'a');
   }
}

int main(){
   ll N;
   cin>>N;
   ll k=0;
   ll i=1e5;
   vll P(10);
   while(k<10){
       bool C=true;
       for(ll j=2;j*j<=i;j++){
           if(i%j==0){
               C=false;
           }
       }
       if(C){
           P[k]=i;
           k++;
        }
       i++;
   }
   vll PP;
   set<ll> S;
   rep(i,10){
       for(ll j=i;j<10;j++){
           PP.push_back(P[i]*P[j]);
       }
   }
   PP.push_back(1);
   sort(all(PP));
   cout<<PP[N-1]<<endl;
}