
    Given a fleet of n delivery vehicles, determine the largest sub-fleet size (which must be a power of 2) that can be formed without exceeding the total number of available vehicles. This sub-fleet size will be used to create the primary routing zone for optimal dispatch patterns.
    

    
def highest_Power_of_2(n):
    """
    Given a fleet of n delivery vehicles, determine the largest sub-fleet size (which must be a power of 2) that can be formed without exceeding the total number of available vehicles. This sub-fleet size will be used to create the primary routing zone for optimal dispatch patterns.
    

    """
def highest_Power_of_2(n):
    """
    Given a fleet of n delivery vehicles, determine the largest sub-fleet size (which must be a power of 2) that can be formed without exceeding the total number of available vehicles. This sub-fleet size will be used to create the primary routing zone for optimal dispatch patterns.
    

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