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