#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <stdio.h>
#include <queue>
#include <deque>
#include <cstdio>
#include <set>
#include <map>
#include <bitset>
#include <stack>
#include <cctype>
using namespace std;
long long a[1000] = { 0 };
int main() {
	int co = 0;
	int n;
	cin >> n;
	for (long long i = 100001; i < 110000; i++) {
		bool b = true;
		for (long long j = 2; j * j < i; j++) {
			if (i % j == 0) {
				b = false;
			}
		}
		if (b == true) {
			a[co] = i;
			co++;
		}
	}
	vector<long long> vec;
	for (int i = 0; i < 863; i++) {
		for (int j = 0; j < 863; j++) {
			vec.emplace_back(a[i] * a[j]);
		}
	}
	vec.emplace_back(1);
	sort(vec.begin(), vec.end());
	cout << vec[n - 1] << endl;
	return 0;
}