#include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <class T, class U> using Pa = pair<T, U>;
template <class T> using vec = vector<T>;
template <class T> using vvec = vector<vec<T>>;

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    vec<ll> prime;
    for(int i=1e5+1;i<=2e5;i++){
        int n = i;
        bool ok = true;
        for(int j=2;j*j<=n;j++){
            ok &= n%j!=0;
        }
        if(ok){
            prime.push_back(i);
        }
        if(prime.size()==10){
            break;
        }
    }
    vec<ll> ans;
    for(int i=0;i<10;i++) for(int j=i;j<10;j++) ans.push_back(prime[i]*prime[j]);
    sort(ans.begin(),ans.end());
    int N;
    cin >> N;
    if(N==1) cout << 1 << "\n";
    else cout << ans[N-2] << "\n";
}