Give an algorithm to find both the maximum and minimum of 380 distinct numbers that uses at most 568 comparisons.