#include <bits/stdc++.h>
#define ll long long
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = 1; i <= n; i++)
ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
ll lcm(ll a, ll b) { return (a * b) / gcd(a,b); }
using P = pair <int, int>;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }

ll MOD = 1000000007;
ll INF =1<<30;
bool sosu(ll n){
    if(n==1) return false;
    if(n==2) return true;
    for(int i = 2;i*i<=n;++i){
        if(n%i==0) return false;
    }
    return true;
}
int main(){
    int n;
    cin >> n;
    vector<ll> b;
    for(int i = 100001;;i++){
        if(sosu(i)) b.push_back(i);
        if(b.size()==4) break;
    }
    vector<ll> c;
    rep(i,b.size()){
        rep(j,b.size()){
            c.push_back(b[i]*b[j]);
        }
    }
    sort(c.begin(),c.end());
    if(n==1) cout << 1<<endl;
    else cout << c[n-2] <<endl;
}