def count_Primes_nums(n):
    if n <= 2:
        return 0
    sieve = [True] * n
    sieve[0] = sieve[1] = False
    limit = int(n ** 0.5) + 1
    for i in range(2, limit):
        if sieve[i]:
            start = i * i
            sieve[start:n:i] = [False] * (((n - 1 - start) // i) + 1)
    return sum(sieve)