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

bool IsPrime(ll n){
    if (n < 2) return 0;
    if (n == 2) return 1;
    if (n % 2 == 0) return 0;
    double nn = sqrt(n);
    for (ll i=3;i<=nn;i+= 2)if(n % i == 0)return 0;
    return 1;
}

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

    int N; cin >> N;
    ll cal[] = {100003, 100019, 100043, 100049, 100057, 100069, 100103};
    if(N == 1){
        cout << 1 << endl;
        return 0;
    }

    vector<ll> v;
    for(auto a : cal){
        for(auto b : cal){
            ll tmp = a * b;
            bool ok = true;
            for(auto c : v){
                if(c == tmp) ok = false;
            }
            if(ok) v.emplace_back(tmp);
        }
    }

    sort(v.begin(), v.end());
    cout << v[N-2] << endl;
}