//mergesort

#include <iostream>
#include <fstream>
#include <algorithm>
//#include <vector>

using namespace std;

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

#define MAX_n 500000

void interclasare (int v[], int left, int mid, int right, int interclas[])
{
    int i = left, j = mid + 1, poz = 0;
    while(i <= mid && j <= right)
    {
        if(v[i] < v[j])
            interclas[poz++] = v[i++];
        else
            interclas[poz++] = v[j++];
    }

    while (i <= mid)
        interclas[poz++] = v[i++];
    while (j <= right)
        interclas[poz++] = v[j++];

    for(i = 0; i < poz; i ++)
        v[left + i] = interclas[i];
}

void mergesort(int v[], int left, int right, int interclas[])
{
    if(left >= right) return;

    int mid = (left + right) / 2;

    mergesort (v, left, mid, interclas);
    mergesort (v, mid + 1, right, interclas);

    interclasare(v, left, mid, right, interclas);
}

int main()
{
    int n;

    fin >> n;

    int* v;
    int* interclas;
    v = new int[0]();
    interclas = new int[0]();

    for(int i = 0; i < n; ++i)
    {
        fin >> v[i];
    }

    mergesort(v, 0, n - 1, interclas);

    for(int i = 0; i < n; ++i)
    {
        fout << v[i] << " ";
    }

    return 0;
}