
    Given the total number of potential bus stops in a city's transportation network, determine how many optimal distribution points exist for creating non-overlapping route segments, where an optimal point is defined by having no common factors with other points except 1. Return the count of these optimal distribution points that are less than the total number of potential stops.
    

    
def count_Primes_nums(n):
    """
    Given the total number of potential bus stops in a city's transportation network, determine how many optimal distribution points exist for creating non-overlapping route segments, where an optimal point is defined by having no common factors with other points except 1. Return the count of these optimal distribution points that are less than the total number of potential stops.
    

    """
def count_Primes_nums(n):
    """
    Given the total number of potential bus stops in a city's transportation network, determine how many optimal distribution points exist for creating non-overlapping route segments, where an optimal point is defined by having no common factors with other points except 1. Return the count of these optimal distribution points that are less than the total number of potential stops.
    

    """
    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