#include <fstream>

using namespace std;

ifstream fin ("algsort.in");
ofstream fout ("algsort.out");

int a[500001], n;
void mrg(int l, int m, int r)
{
    int i, j, k;
    int n1 = m - l + 1;
    int n2 =  r - m;

    int L[n1], R[n2];

    for (i = 0; i < n1; i++)
        L[i] = a[l + i];
    for (j = 0; j < n2; j++)
        R[j] = a[m + 1+ j];

    i = 0;
    j = 0;
    k = l;
    while (i < n1 && j < n2)
    {
        if (L[i] <= R[j])
        {
            a[k] = L[i];
            i++;
        }
        else
        {
            a[k] = R[j];
            j++;
        }
        k++;
    }

    while (i < n1)
    {
        a[k] = L[i];
        i++;
        k++;
    }

    while (j < n2)
    {
        a[k] = R[j];
        j++;
        k++;
    }
}

void msort(int l, int r)
{
    if (l < r)
    {
        int m = l+(r-l)/2;

        msort(l, m);
        msort(m+1, r);

        mrg(l, m, r);
    }
}

void afis()
{
    int i;
    for (i=0; i < n; i++)
        fout << a[i] << ' ';
}
int main()
{
    fin >> n;
    for (int i = 0; i <= n; i++)fin >> a[i];
    msort(0, n - 1);
    afis();
    return 0;
}