In your bovine history class, you have been given a rather long homework assignment with questions, each graded with an integer score in the range to 10^4. As is customary, your teacher plans to assign a final grade by discarding the question on which you received the lowest score and then averaging the remaining scores. Unfortunately, your pet cow Bessie has just eaten your answers to the first questions! ( can be as small as or as large as n - 2.)
After a lengthy explanation, your teacher finally believes your story and agrees to grade the remaining, non-eaten part of the assignment in the same way as before: by removing the lowest-scoring question (or one of the lowest-scoring questions, in the event of a tie) and averaging the remaining scores.
Determine all values of that would have earned you the maximum possible score under this grading scheme, and output them in sorted order.
The first line contains n~(3 \le n \le 10^5), and the next line contains the scores for the homework questions.
Print one value per line, containing all values of that would have earned you the maximum possible score.
If Bessie eats the first two questions, the remaining scores are , , and . After removing the minimum score and averaging the remaining scores, the final grade is , which is the highest possible score.
Example 1