Given N integers. Find the third largest maximum element of the sequence (the element that would stand third if the input data were sorted non-decreasing)

Input:
the first line sets the number N(\(3<=N<=10^5\))
then there are N lines, one number in each line Output:
print the third maximum element