#include <iostream> using namespace std; bool isPrime(int num) { if (num <= 1) return false; if (num <= 3) return true; if (num % 2 == 0 || num % 3 == 0) return false; for (int i = 5; i * i <= num; i += 6) { if (num % i == 0 || num % (i + 2) == 0) return false; } return true; } int main() { int n; cin >> n; int count = 0; int num = 1; while (count < n) { num++; if (isPrime(num)) { count++; } } cout << num << endl; return 0; }