# Practice on Toph

Participate in exhilarating programming contests, solve unique algorithm and data structure challenges and be a part of an awesome community.

Participate in exhilarating programming contests, solve unique algorithm and data structure challenges and be a part of an awesome community.

Limits
1s, 512 MB

In this problem, you will have to print the `$n$`

-th prime number. The first few prime numbers are given below:

2, 3, 5, 7, 11, 13, 17, 19, 23, 29, …

2 is the 1st prime, 3 is the 2nd prime, 5 is the 3rd prime, …

The input will contain a single integer `$n$`

(`$0 < n < 500000$`

).

Print the `$n$`

-th prime number.

Input | Output |
---|---|

1 | 2 |

Input | Output |
---|---|

2 | 3 |

66% Solution Ratio

Wl.ReinoEarliest,

Farabi.743600Fastest, 0.0s

riadroxLightest, 131 kB

touhidurShortest, 115B

Login to submit