#include <bits/stdc++.h>
#include <iomanip>
using namespace std;
#define reps(i,s,n) for(int i = s; i < n; i++)
#define rep(i,n) reps(i,0,n)
#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)
#define Rrep(i,n) Rreps(i,n,0)
#define ALL(a) a.begin(), a.end()
#define fi first
#define se second
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;

ll N,M,H,W,Q,K,A,B;
string S;
const ll MOD = 998244353;
//const ll MOD = (1e+9) + 7;
typedef pair<ll, ll> P;
const ll INF = (1LL<<62);

int main() {
    vec prime(0);
    for(ll i = ll(1e+5) + 1; i < 2e+5; ++i){
        bool p = true;
        for(ll j = 2; j * j <= i; ++j){
            if(i%j == 0){
                p = false;
                break;
            }
        }
        if(p){
            prime.push_back(i);
        }
        if(prime.size() == 11) break;
    }
    cin>>N;
    if(N == 1){
        cout<<1<<endl;
    }else{
        vec steki(0);
        rep(i,11){
            rep(j,i + 1){
                steki.push_back(prime[i] * prime[j]);
            }
        }
        sort(ALL(steki));
        cout<<steki[N - 2]<<endl;
    }
}