https://www.e-olymp.com/az/problems/1656

/*
    Author: Kanan Asgarli
    https://www.e-olymp.com/az/problems/1656
*/
#include <iostream>
#include <set>
#include <algorithm>
using namespace std;
set<int>s;
set<int>:: iterator it;
int n, a, m[65536], k;
int main()
{
    cin>>n;
    for(int i = 0; i < n; i++){
        cin>>a;
        s.insert(a);
    }
    for(it = s.begin(); it != s.end(); it++){
        m[k++] = *it;
    }
    if(n%2 == 1){
        for(int i = 0; i < k; i++)
            cout<<m[i]<<endl;
    }
    else{
        for(int i = k-1; i >= 0; i--)
            cout<<m[i]<<endl;
    }
    return 0;
}