Let S be an array with n distinct integers. Similar to the selection algorithm, we partition S into n / 11 sub-arrays, each of which contains 11 numbers. Let x be the median of the medians of the LaTeX: n/11n / 11 sub-arrays. How many numbers in LaTeX: SS are guaranteed to be less than LaTeX: xx?