#C9552. Nth Prime Square

    ID: 53658 Type: Default 1000ms 256MiB

Nth Prime Square

Nth Prime Square

In this problem, you are given a positive integer N. Your task is to calculate the square of the Nth prime number. A prime number is a natural number greater than 1 that has no positive divisors other than 1 and itself. The result should be the square of this prime number.

Mathematically, if (p_n) is the Nth prime number, you need to compute (p_n^2). For example, when N = 1, the first prime is 2 and (2^2 = 4); when N = 5, the fifth prime is 11 and (11^2 = 121).

inputFormat

The input is read from standard input (stdin) and consists of a single line containing one integer N (1 ≤ N ≤ 10^5, though constraints can be moderate for this problem, typical test cases will involve relatively small values of N).

outputFormat

Output the square of the Nth prime number to standard output (stdout).## sample

1
4

</p>