#include<bits/stdc++.h>
#define rep(i,a) for(int i=(int)0;i<(int)a;++i)
#define rrep(i,a) for(int i=(int)a-1;i>=0;--i)
#define REP(i,a,b) for(int i=(int)a;i<(int)b;++i)
#define RREP(i,a,b) for(int i=(int)a-1;i>=b;--i)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
using ll=long long;
constexpr ll mod = 1e9 + 7;
constexpr ll INF = 1LL << 60;
 
template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}


ll gcd(ll n, ll m) {
    ll tmp;
    while (m!=0) {
        tmp = n % m;
        n = m;
        m = tmp;
    }
		return n;
}

ll lcm(ll n, ll m) {
    return abs(n) / gcd(n, m)*abs(m);//gl=xy
}

using namespace std;

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



void solve()
{
	int n;
	cin>>n;
	if(n==1){
		cout << 1 << endl;
		return;
	}
	n--;
	priority_queue<ll, vector<ll>, greater<ll>> pq;
	vector<ll> v;
	for (ll i = 1e5 + 1;; ++i)
	{
		if(is_prime(i)){
			if(v.size()==0){
				pq.emplace(i * i);
				v.pb(i);
			}
			else{
				rep(j,v.size()){
					pq.emplace(v[j] * i);
				}
				if(pq.size()>=n){
					break;
				}
			}
		}
		else{
			pq.emplace(i);
			rep(j,v.size()){
					pq.emplace(v[j] * i);
				}
				if(pq.size()>=n){
					break;
				}
		}
	}
	ll x;
	rep(i, n)
	{
		x = pq.top();
		pq.pop();
	}
	cout << x << endl;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout<<fixed<<setprecision(15);
    solve();
    return 0;
}