Sum of Primes Less Than N

Given a positive integer N, your task is to calculate the sum of all prime numbers that are strictly less than N.

A prime number is a natural number greater than 1 that has no divisors other than 1 and itself. In other words, a number p is prime if it cannot be written in the form \( p = a \times b \) where \( a \) and \( b \) are natural numbers greater than 1.

For example, if N = 10, the prime numbers less than 10 are 2, 3, 5, and 7. Their sum is \(2 + 3 + 5 + 7 = 17\).

inputFormat

The input consists of a single integer N provided through standard input.

outputFormat

Output a single integer, which is the sum of all prime numbers less than N, to standard output.

10

17