Nth Prime Number

Given a positive integer \( n \) (where \(1 \le n \le 10000\)), your task is to calculate the \(n\)th prime number. A prime number is a natural number greater than 1 that has no positive divisors other than 1 and itself.

For example, the 1st prime number is 2, the 6th prime is 13, and so on. If the input \( n \) is less than 1, the program should raise an error (or in practice, you can assume the input is valid as per the constraints).

inputFormat

The input consists of a single integer \( n \) read from standard input.

Constraints: \(1 \le n \le 10000\).

outputFormat

Output the \(n\)th prime number to standard output.

1

2