
    Given the total number of potential bus stops in a transportation network, determine how many optimal stopping points exist by finding the count of prime numbers less than the total stops, where prime numbers represent stops that provide ideal spacing and passenger coverage. Each optimal stopping point must follow the mathematical property of being divisible only by 1 and itself, ensuring efficient route distribution.
    

    
def count_Primes_nums(n):
    """
    Given the total number of potential bus stops in a transportation network, determine how many optimal stopping points exist by finding the count of prime numbers less than the total stops, where prime numbers represent stops that provide ideal spacing and passenger coverage. Each optimal stopping point must follow the mathematical property of being divisible only by 1 and itself, ensuring efficient route distribution.
    

    """
def count_Primes_nums(n):
    """
    Given the total number of potential bus stops in a transportation network, determine how many optimal stopping points exist by finding the count of prime numbers less than the total stops, where prime numbers represent stops that provide ideal spacing and passenger coverage. Each optimal stopping point must follow the mathematical property of being divisible only by 1 and itself, ensuring efficient route distribution.
    

    """
    ctr = 0
    for num in range(n):
        if num <= 1:
            continue
        for i in range(2, num):
            if num % i == 0:
                break
        else:
            ctr += 1
    return ctr