Prime | 프로그래밍의 벗 PivotOJ
PivotOJ

Prime

시간 제한: 2000ms메모리 제한: 512MB출처: NOI 2008BOJ 9842

문제

A prime number is a natural number which has exactly two distinct natural number divisors: 1 and itself. The first prime number is 2. Can you write a program that computes the nth prime number, given a number n ≤ 10000?

입력

The input contains just one number which is the number n as described above. The maximum value of n is 10000.

출력

The output consists of a single integer that is the nth prime number.

예제

예제 1

입력
30
출력
113
코드를 제출하려면 로그인하세요.