An unordered list contains $n$ distinct elements. The number of comparisons to find an element in this list that is neither maximum nor minimum is