Min & Max

Given an array of $n$ distinct numbers, finding the minimum takes $n-1$ comparisons, and finding the maximum takes $n-1$ comparisons. If you have to find both the minimum and the maximum, what is the smallest number of comparisons that suffices in the worst case when $n=20$?