Exact comparisons for min and max

You must find both the minimum and the maximum of $n = 100$ distinct numbers using the fewest element comparisons. Work out the exact minimum number of comparisons that always suffices (not the $\sim\tfrac{3n}{2}$ ballpark - the precise integer).