def count_Primes_nums(n):
    if n <= 2:
        return 0

    is_prime = [True] * n
    is_prime[0] = False
    is_prime[1] = False

    limit = int(n ** 0.5) + 1
    for number in range(2, limit):
        if is_prime[number]:
            start = number * number
            for multiple in range(start, n, number):
                is_prime[multiple] = False

    return sum(is_prime)