#include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define rep(i, n) for(int i=0;i<n;++i)
#define rrep(i, n) for(int i=n;i>=0;--i)
const int inf=1e9+7;
const ll mod=1e9+7;
const ll big=1e18;
const double PI=2*asin(1);

int main() {
    bool prime[1000005];
    for(int i=0;i<=1000000;++i){
        prime[i] = true;
    }
    prime[1] = false;
    for(int i=2;i<=1000000;++i){
        if(prime[i]==false) continue;
        for(int j=2;i*j<=1000000;++j){
            prime[i*j] = false;
        }
    }
    int N;
    cin>>N;
    vector<ll> primes;
    vector<ll> doubleprime;
    if(N==1) cout<<1<<endl;
    else{
        for(ll i=100001;i<=1000000;++i){
            if(primes.size()>20) break;
            if(prime[i]==true) primes.push_back(i);
        }
        for(int i=0;i<20;++i){
            for(int j=0;j<20;++j){
                doubleprime.push_back(primes[i]*primes[j]);
            }
        }
        sort(doubleprime.begin(), doubleprime.end());
        cout<<doubleprime[N-2]<<endl;
    }
}