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