#include "bits/stdc++.h"
using namespace std;
#define int long long
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
#define RREP(i, n) for (int i = (int)n - 1; i >= 0; --i)
#define FOR(i, s, n) for (int i = s; i < (int)n; ++i)
#define RFOR(i, s, n) for (int i = (int)n - 1; i >= s; --i)
#define ALL(a) a.begin(), a.end()
#define IN(a, x, b) (a <= x && x < b)
template<class T>inline void out(T t){cout << t << "\n";}
template<class T,class... Ts>inline void out(T t,Ts... ts){cout << t << " ";out(ts...);}
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;}
constexpr int INF = 1e18;

#define endl '\n'
#define IOS() ios_base::sync_with_stdio(0);cin.tie(0)


const int M = 2750131;
int P[200000];
int invP[M + 1];
int minP[M + 1];
bool isP[M + 1];
 
void Eratosthenes() {
	int p = 0;
	REP(i, M + 1) isP[i] = true, minP[i] = -1;
	isP[0] = isP[1] = false;
	minP[0] = 0; minP[1] = 1;
	FOR(i, 2, M + 1) {
		if (isP[i]) {
			minP[i] = i;
			P[p] = i;
			invP[i] = p++;
			for (int j = i * 2; j < M; j += i) {
				isP[j] = false;
				if (minP[j] == -1) minP[j] = i;
			}
		}
	}
}
void solve(){
	Eratosthenes();
	int N;
	cin >> N;
	if(N == 1){
		out(1);
		return;
	}
	vector<int>v;
	FOR(i,100001,200000){
		if(v.size() == N)break;
		if(isP[i]){
			v.emplace_back(i);
		}
	}
	vector<int>vv;
	REP(i,v.size()){
		REP(j,v.size()){
			vv.emplace_back(v[i] * v[j]);
		}
	}
	sort(vv.begin(), vv.end());
	vv.erase(unique(vv.begin(), vv.end()), vv.end());
	out(vv[N - 2]);
}

signed main(){
	IOS();
	int Q = 1;
	//cin >> Q;
	while(Q--)solve();
}