An unordered list contains n distinct elements. What is the number of comparisons required to find an element in this list that is neither the maximum nor the minimum?