Sorting#1656
Given a sequence of -bit signed integers, sort the sequence and remove all duplicate elements, i.e., keep only one occurrence of each number in the sequence.
The first line contains the number of elements (1 \leq n \leq 65536) in the sequence. The next lines each contain one integer.
Output no more than numbers: sort them in descending order if is even, and in ascending order if is odd. Each number should appear at most once.
Example 1