Superprime numbers.#7462
Andriyko was sitting in biology class and feeling bored, so he decided to occupy his mind with some number exercises. He remembered studying prime numbers in math class. (Recall that a prime number is a number greater than one that has exactly two divisors: one and itself.)
Andriyko wrote down the prime numbers in ascending order and denoted the -th number in this sequence as p_i. (For example, p_1 = 2, p_2 = 3, p_3 = 5, p_{52} = 239.) Then it occurred to him to make the problem more interesting and find those prime numbers whose positions in the list of ordered primes are themselves prime numbers. He called such numbers "superprime". Listing all the superprime numbers in ascending order, Andriyko decided to find the one at the -th position.
The only line of input contains the number , where 1 \leq k \leq 5000.
The only line of output should contain the superprime number that is the -th term in the ordered sequence of superprime numbers.
Example 1
Example 2
Example 3