
    In a delivery fleet management system, given a binary status code representing vehicle availability where 1 indicates an occupied vehicle and 0 indicates an available vehicle, develop a function that identifies and assigns (sets to 1) the leftmost available vehicle in the fleet. The function should efficiently update the fleet status by converting the first available vehicle (leftmost 0) to occupied (1), enabling optimal vehicle allocation for pending deliveries.
    

    
def set_left_most_unset_bit(n):
    """
    In a delivery fleet management system, given a binary status code representing vehicle availability where 1 indicates an occupied vehicle and 0 indicates an available vehicle, develop a function that identifies and assigns (sets to 1) the leftmost available vehicle in the fleet. The function should efficiently update the fleet status by converting the first available vehicle (leftmost 0) to occupied (1), enabling optimal vehicle allocation for pending deliveries.
    

    """
def set_left_most_unset_bit(n):
    """
    In a delivery fleet management system, given a binary status code representing vehicle availability where 1 indicates an occupied vehicle and 0 indicates an available vehicle, develop a function that identifies and assigns (sets to 1) the leftmost available vehicle in the fleet. The function should efficiently update the fleet status by converting the first available vehicle (leftmost 0) to occupied (1), enabling optimal vehicle allocation for pending deliveries.
    

    """
    if not n & n + 1:
        return n
    (pos, temp, count) = (0, n, 0)
    while temp:
        if not temp & 1:
            pos = count
        count += 1
        temp >>= 1
    return n | 1 << pos