#include<bits/stdc++.h>

using namespace std;
using ll = long long;

vector<ll> divisor(ll n){
    vector<ll> res;
    for(ll i = 1LL; i * i <= n; i++){
        if(n % i == 0){
            res.push_back(i);
            ll j = n / i;
            if(i != j)res.push_back(j);
        }
    }
    sort(res.begin(),res.end());
    return res;
}

/***********debug tools***********/
template<class T> ostream& operator<<(ostream& os, const pair<T,T>& p){os << "{" << p.first << "," << p.second << "}";return os; }
template<class T> inline void print(pair<T,T> p){cerr << p << endl;}
template<class T> inline void print(vector<T> arr) {cerr << "["; for(int i = 0; i < (int)arr.size(); i++)cerr << arr[i] << (i == (int)arr.size() - 1 ? "]" : ",");cerr << endl;}
template<class T> inline void print(vector<vector<T>> arr) {cerr << "[-------------------" << endl; for(int i = 0; i < (int)arr.size(); i++) { print(arr[i]);} cerr << "-------------------]" << endl;}
/*********************************/


int main()
{
    vector<ll> prime;
    for(int i = 100001; prime.size() <= 100; i++) {
        if(divisor(i).size() == 2)prime.push_back(i);
    }
    vector<ll> a;
    int m = prime.size();
    for(int i = 0; i < m; i++) {
        for(int j = 0; j < m; j++) {
            a.emplace_back(prime[i] * prime[j]);
        }
    }
    sort(a.begin(), a.end());
    int n; cin >> n;
    if(n == 1) {
        cout << 1 << endl;
    } else {
        cout << a[n - 2] << endl;
    }
}