
    Given the number of active ride-share vehicles in a service zone, determine the largest group size (which must be a power of 2) that can be formed for efficient batch processing of ride requests without exceeding the total available vehicles. This grouping strategy ensures optimal load distribution across the ride-matching system while maintaining balanced vehicle clusters.
    

    
def highest_Power_of_2(n):
    """
    Given the number of active ride-share vehicles in a service zone, determine the largest group size (which must be a power of 2) that can be formed for efficient batch processing of ride requests without exceeding the total available vehicles. This grouping strategy ensures optimal load distribution across the ride-matching system while maintaining balanced vehicle clusters.
    

    """
def highest_Power_of_2(n):
    """
    Given the number of active ride-share vehicles in a service zone, determine the largest group size (which must be a power of 2) that can be formed for efficient batch processing of ride requests without exceeding the total available vehicles. This grouping strategy ensures optimal load distribution across the ride-matching system while maintaining balanced vehicle clusters.
    

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