
    Given a delivery fleet of n vehicles, determine the largest sub-fleet size (which must be a power of 2) that can be formed without exceeding the total fleet size to enable efficient hierarchical route management. For example, if there are 50 vehicles, the largest possible sub-fleet would be 32 vehicles (2^5), as the next power of 2 (64) would exceed the total fleet size.
    

    
def highest_Power_of_2(n):
    """
    Given a delivery fleet of n vehicles, determine the largest sub-fleet size (which must be a power of 2) that can be formed without exceeding the total fleet size to enable efficient hierarchical route management. For example, if there are 50 vehicles, the largest possible sub-fleet would be 32 vehicles (2^5), as the next power of 2 (64) would exceed the total fleet size.
    

    """
def highest_Power_of_2(n):
    """
    Given a delivery fleet of n vehicles, determine the largest sub-fleet size (which must be a power of 2) that can be formed without exceeding the total fleet size to enable efficient hierarchical route management. For example, if there are 50 vehicles, the largest possible sub-fleet would be 32 vehicles (2^5), as the next power of 2 (64) would exceed the total fleet size.
    

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