#include <iostream>
#include <queue> // kju / deque (dek)
                 
using namespace std;

void sort(vector<int> &a)
{
    const int n = a.size();

    deque<int> dq;
    dq.push_back(a[0]);

    for (int i = 1; i < n; i++) {
        if (dq.back() > a[i]) {
            dq.push_front(a[i]);
        } else {
            dq.push_back(a[i]);
        }
    }

    for (int i = 0; i < n; i++) {
        a[i] = dq.front();
        dq.pop_front();
    }
}

int main(void)
{
    int n;
    cin >> n;

    vector<int> a(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }

    sort(a);

    for (int i = 0; i < n; i++) {
        cout << a[i] << " ";
    }
    cout << endl;

    return 0;
}