Sum of First N Primes

You are given an integer \(N\). Your task is to compute the sum of the first \(N\) prime numbers. A prime number is a natural number greater than 1 that has no positive divisors other than 1 and itself. The sum can be mathematically represented as \(\sum_{i=1}^{N} p_i\) where \(p_i\) denotes the \(i^{th}\) prime number.

For example, if \(N = 5\), the first 5 primes are 2, 3, 5, 7, and 11, and their sum is 28.

inputFormat

The input consists of a single integer \(N\) on a new line provided via standard input. \(N\) represents the number of prime numbers to be summed.

outputFormat

Output a single integer which is the sum of the first \(N\) prime numbers. The result should be printed to standard output without any extra characters.

5

28