#include <iostream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstdlib>
#include <cassert>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <string>
#include <algorithm>
#include <utility>
#define llint long long
#define inf 1e18
#define rep(x, s, t) for(llint (x) = (s); (x) < (t); (x)++)
#define Rep(x, s, t) for(llint (x) = (s); (x) <= (t); (x)++)
#define chmin(x, y) (x) = min((x), (y))
#define chmax(x, y) (x) = max((x), (y))

using namespace std;
typedef pair<llint, llint> P;

llint n;
bool prime[1000005];
vector<llint> pvec, vec;

int main(void)
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	for(int i = 2; i < 100005; i++){
		if(prime[i]) continue;
		for(int j = 2*i; j < 1000005; j+=i) prime[j] = true;
	}
	
	for(int i = 100001; i < 1000000; i++){
		if(!prime[i]) pvec.push_back(i);
	}
	vec.push_back(1);
	
	for(int i = 0; i < 20; i++){
		for(int j = 0; j < 20; j++){
			if(i > j) continue;
			vec.push_back(pvec[i]*pvec[j]);
		}
	}
	sort(vec.begin(), vec.end());
	
	cin >> n;
	cout << vec[n-1] << endl;
	
	return 0;
}