Count Primes

Medium

Given an integer n, return the number of prime numbers strictly less than n.

Example 1

Input:  n = 10
Output: 4

Example 2

Input:  n = 0
Output: 0

Example 3

Input:  n = 2
Output: 0

Constraints

• 0 <= n <= 5*10^6