
    Given the total number of delivery zones in a region, determine the largest number of equal-sized sub-zones (which must be a power of 2) that can be created without exceeding the original zone count to ensure optimal workload distribution among delivery vehicles. For example, if there are 30 delivery zones, the function should return 16 (2^4) as it's the largest power of 2 that doesn't exceed 30, allowing for balanced route allocation.
    

    
def highest_Power_of_2(n):
    """
    Given the total number of delivery zones in a region, determine the largest number of equal-sized sub-zones (which must be a power of 2) that can be created without exceeding the original zone count to ensure optimal workload distribution among delivery vehicles. For example, if there are 30 delivery zones, the function should return 16 (2^4) as it's the largest power of 2 that doesn't exceed 30, allowing for balanced route allocation.
    

    """
def highest_Power_of_2(n):
    """
    Given the total number of delivery zones in a region, determine the largest number of equal-sized sub-zones (which must be a power of 2) that can be created without exceeding the original zone count to ensure optimal workload distribution among delivery vehicles. For example, if there are 30 delivery zones, the function should return 16 (2^4) as it's the largest power of 2 that doesn't exceed 30, allowing for balanced route allocation.
    

    """
    res = 0
    for i in range(n, 0, -1):
        if i & i - 1 == 0:
            res = i
            break
    return res