Let S={x1,x2,....x3} be a set of n positive integers. We want to find an element x that is in the upper half when S is sorted, or in other words an element that is greater than the median. What is the minimum number of element comparision required to solve this problem ?