#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repr(i,n) for(int i = (int)(n); i >= 0; i--)
#define all(v) v.begin(),v.end()
typedef long long ll;

int main(){
    ll N;
    cin >> N;
    vector<ll> Primeover(0);
    Primeover.push_back(100003);
    Primeover.push_back(100019);
    Primeover.push_back(100043);
    Primeover.push_back(100049);
    Primeover.push_back(100057);
    Primeover.push_back(100069);
    Primeover.push_back(100103);
    Primeover.push_back(100109);
    Primeover.push_back(100129);
    Primeover.push_back(100151);
    vector<ll> ans(0);
    ans.push_back(1);
    for (int i = 0; i < 10; i++){
        for (int j = i; j < 10; j++){
            ans.push_back(Primeover[i] * Primeover[j]);
        }
    }
    sort(all(ans));
    cout << ans[N - 1] << endl;
}