#include <fstream>

using namespace std;

unsigned int v[500001];

void merge(unsigned int v[], unsigned int l, unsigned int m, unsigned int r)
{
    unsigned int i, j, k;
    unsigned int n1 = m - l + 1;
    unsigned int n2 =  r - m;
    unsigned int L[n1], R[n2];
    for (i = 0; i < n1; i++)
        L[i] = v[l + i];
    for (j = 0; j < n2; j++)
        R[j] = v[m + 1+ j];
    i = 0;
    j = 0;
    k = l;
    while (i < n1 && j < n2)
    {
        if (L[i] <= R[j])
        {
            v[k] = L[i];
            i++;
        }
        else
        {
            v[k] = R[j];
            j++;
        }
        k++;
    }
    while (i < n1)
    {
        v[k] = L[i];
        i++;
        k++;
    }
    while (j < n2)
    {
        v[k] = R[j];
        j++;
        k++;
    }
}

void mergeSort(unsigned int v[], unsigned int l, unsigned int r)
{
    if (l < r)
    {
        unsigned int m = l+(r-l)/2;
        mergeSort(v, l, m);
        mergeSort(v, m+1, r);
        merge(v, l, m, r);
    }
}

int main()
{
    unsigned int n, i;
    ifstream fin("algsort.in");
    fin >> n;
    for(i = 0; i < n; ++i)
    {
        fin >> v[i];
    }
    fin.close();
    mergeSort(v, 0, n-1);
    ofstream fout("algsort.out");
    for(i = 0; i < n; ++i)
    {
        fout << v[i] << " ";
    }
    return 0;
}