#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
template<class T> inline bool chmax(T&a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T> inline bool chmin(T&a,T b){if(a>b){a=b;return 1;}return 0;}
using ll = long long;

int n;

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

int main() {
    ios::sync_with_stdio(false); 
    cin.tie(0);
    
    cin >> n;
    vector<ll> v;
    for(int i=1e5+1;v.size()<n;i++){
        if(is_prime(i)) v.push_back(i);   
    }
    vector<ll> a={1};
    rep(i,n)rep(j,i+1) a.push_back(v[i]*v[j]);
    sort(a.begin(),a.end());
    cout << a[n-1] << endl;
}