#include <iostream>
#include <vector>
#include <climits>
#include <algorithm>
#include <cmath>
#include <map>
#include <set>
#include <string>
#include <bitset>
#include <utility>
#include <numeric>
#include <queue>
#include <stack>

using ll = long long;
using namespace std;

constexpr int MOD = 1e9 + 7;
constexpr ll MOD_LL = ll(1e9 + 7);

template<typename T>
bool is_prime(T n) {
	for(int i = 2; i * i <= n; ++i) {
		if( n % i == 0 ) {
			return true;
		}
	}
	
	return false;
}

int main(void) {
	int n;
	cin >> n;
	
	ll x = 1e5;	
	vector<ll> primes;
	
	while( primes.size() <= n ) {
		if( is_prime(x) ) primes.push_back(x);
		
		x++;
	}
	
	vector<ll> ans;
	ans.push_back(1LL);
	
	for(int i = 0; i < primes.size(); ++i) {
		for(int j = i; j < primes.size(); ++j) {
			ans.push_back(primes[i] * primes[j]);
		}
	}
	
	sort(ans.begin(), ans.end());
	
	cout << ans[n - 1] << endl;
	
	return 0;
}