
    Given the total number of potential delivery routes available in a logistics system, determine how many fundamental independent routes exist that cannot be further subdivided into smaller paths. These indivisible routes are essential for optimizing the delivery fleet's path planning and are represented by prime numbers less than the total route count.
    

    
def count_Primes_nums(n):
    """
    Given the total number of potential delivery routes available in a logistics system, determine how many fundamental independent routes exist that cannot be further subdivided into smaller paths. These indivisible routes are essential for optimizing the delivery fleet's path planning and are represented by prime numbers less than the total route count.
    

    """
def count_Primes_nums(n):
    """
    Given the total number of potential delivery routes available in a logistics system, determine how many fundamental independent routes exist that cannot be further subdivided into smaller paths. These indivisible routes are essential for optimizing the delivery fleet's path planning and are represented by prime numbers less than the total route count.
    

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