#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i ++)
using namespace std;
typedef long long ll;
typedef pair<ll,ll> PL;
typedef pair<int,int> P;
const int INF = 1e9;
const ll MOD = 1e9 + 7;

bool judge(int x){
    for (int i = 2;i*i <= x;i++){
        if (x%i == 0)return false;
    }
    return true;
}

int main() {
    int N; cin >> N;
    if (N == 1){
        cout << 1 << endl;
        return 0;
    }
    vector<ll> prime;
    for (int i = 100001;;i++){
        if (judge(i)){
            prime.push_back(i);
            if (prime.size() == 15){
                break;
            }
        }
    }
    vector<ll> ans;
    for (int i = 0;i < 15;i++){
        for (int j = i;j < 15;j++){
            ans.push_back(prime[i]*prime[j]);
        }
    }
    sort(ans.begin(),ans.end());
    cout << ans[N - 2] << endl;
    return 0;
}