Sum of Primes

Given a non-negative integer \(N\), calculate the sum of all prime numbers in the interval [1, N]. A prime number is an integer greater than 1 that has no positive divisors other than 1 and itself.

Your task is to implement a program that reads the integer \(N\) from standard input (stdin), computes the sum of prime numbers up to \(N\) inclusive, and prints the result to standard output (stdout).

For instance, if \(N=10\), the prime numbers are \(2, 3, 5, 7\) and their sum is \(17\).

inputFormat

The input consists of a single integer \(N\) on one line. \(N\) represents the upper limit of the range in which you have to find all prime numbers.

outputFormat

Output a single integer which is the sum of all prime numbers in the interval [1, N].

10

17