Deep in the steppe camp of Horselord Plains, Parth studies rows of crates entries. One clean number will settle the guild's oldest argument. Task: Print the lower median: the element at position floor((n-1)/2) after sorting (so for even n it is the smaller of the two middles). Input format: First line: n. Second line: n integers. Output format: Print the lower median. Constraints: 1 <= n <= 252; 0 <= a[i],x <= 1000000.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= n <= 252; 0 <= a[i],x <= 1000000.
