def set_left_most_unset_bit(n):
    bit_length = n.bit_length()
    for position in range(bit_length - 1, -1, -1):
        if ((n >> position) & 1) == 0:
            return n | (1 << position)
    return n