#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <algorithm>
#include <set>
#include <map>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#define vll vector<ll>
#define vvvl vector<vvl>
#define vvl vector<vector<ll>>
#define VV(a, b, c, d) vector<vector<d>>(a, vector<d>(b, c))
#define VVV(a, b, c, d) vector<vvl>(a, vvl(b, vll (c, d)));
#define re(c, b) for(ll c=0;c<b;c++)
#define rep(a,b,c) for(ll a=b;a<c;a++)
#define all(obj) (obj).begin(), (obj).end()
typedef long long int ll;
typedef long double ld;
using namespace std;

void get(vll &a){re(i,a.size()) scanf("%lld",&a[i]);}
void get(vvl &a){re(i,a.size()) re(j,a[0].size()) scanf("%lld",&a[i][j]);}
void print(vll &a){re(i,a.size()) cout<<a[i]<<(i==a.size()-1?"\n":" ");}
void print(vvl &a){re(i,a.size()) re(j,a[0].size())cout<<a[i][j]<<(j==a[0].size()-1?"\n":" ");}

int main(int argc, char const *argv[]) {
  vll d;
  for(ll i=100001;;i++){
    bool f = true;
    for(ll j=2;j*j<=i;j++){
      if(i%j==0){
        f = false;
        break;
      }
    }
    if(f){
      d.push_back(i);
      if(d.size()==10) break;
    }
  }
  vll ans;
  for(int i=0;i<10;i++){
    for(int j=0;j<10;j++){
      ans.push_back(d[i]*d[j]);
    }
  }
  ans.push_back(1);
  sort(all(ans));
  ll n;std::cin >> n;
  std::cout << ans[n-1] << '\n';
}