
    Given the total number of available delivery vehicles during peak traffic hours, determine the largest group size (which must be a power of 2) that can be efficiently coordinated for parallel route assignments without exceeding the fleet capacity. This optimization ensures balanced zone distribution and efficient fleet management during high-traffic periods.
    

    
def highest_Power_of_2(n):
    """
    Given the total number of available delivery vehicles during peak traffic hours, determine the largest group size (which must be a power of 2) that can be efficiently coordinated for parallel route assignments without exceeding the fleet capacity. This optimization ensures balanced zone distribution and efficient fleet management during high-traffic periods.
    

    """
def highest_Power_of_2(n):
    """
    Given the total number of available delivery vehicles during peak traffic hours, determine the largest group size (which must be a power of 2) that can be efficiently coordinated for parallel route assignments without exceeding the fleet capacity. This optimization ensures balanced zone distribution and efficient fleet management during high-traffic periods.
    

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