#include using namespace std; template bool is_prime(T n) { if (n == 0 || n == 1) return false; if (n == 2) return true; if (n % 2 == 0) return false; for (T i = 3; i * i < n + 1; i += 2) { if (n % i == 0) return false; } return true; } int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int N; cin >> N; vector X; for (int64_t x = 100001; x < 100100; x++) { if (is_prime(x)) X.emplace_back(x); } vector cands; cands.emplace_back(1); for (int64_t x : X) { for (int64_t y : X) { cands.emplace_back(x * y); } } sort(cands.begin(), cands.end()); cout << cands[N - 1] << '\n'; return 0; }