```python
def count_Primes_nums(n):
    """
    Counts the number of prime numbers less than a given non-negative number n.
    This implementation uses the Sieve of Eratosthenes algorithm.
    """
    if n < 3:
        return 0

    # Create a boolean list `is_prime` of size n.
    # is_prime[i] will be True if i is a prime number, False otherwise.
    # Initialize all entries to True.
    is_prime = [True] * n
    
    # 0 and 1 are not prime numbers.
    is_prime[0] = False
    is_prime[1] = False

    # Iterate from 2 up to the square root of n.
    # Any composite number will have a prime factor less than or equal to its square root.
    limit = int(n**0.5)
    for number in range(2, limit + 1):
        # If `number` is still marked as prime, it is a prime.
        if is_prime[number]:
            # Mark all multiples of `number` as not prime.
            # We can start marking from number*number because smaller multiples
            # would have already been marked by smaller prime numbers.
            start = number * number
            for multiple in range(start, n, number):
                is_prime[multiple] = False

    # The count of primes is the number of True values in the list.
    prime_count = sum(is_prime)
    return prime_count
```