#include <bits/stdc++.h>

using namespace std;

void cocktail_sort(int A[], int N)
{
    int begin = -1;
    int end = N - 2;
    bool swapped;

    do
    {
        swapped = false;
        begin++;

        for (int i = begin; i <= end; ++i)
            if (A[i] > A[i + 1])
            {
                swap(A[i], A[i + 1]);
                swapped = true;
            }

        if (swapped == false)
            break;

        swapped = false;
        end--;

        for (int i = end; i >= begin; i--)
            if (A[i] > A[i + 1])
            {
                swap(A[i], A[i + 1]);
                swapped = true;
            }

    } while (swapped == true);
}

const int MAX_N = 500000 + 1;

int A[MAX_N];
int N;

int main()
{
    ifstream in("algsort.in");
    ofstream out("algsort.out");

    in >> N;

    for (int i = 0; i < N; ++i)
        in >> A[i];

    cocktail_sort(A, N);

    for (int i = 0; i < N; ++i)
        out << A[i] << " ";

    return 0;
}