#include <iostream>
#include <fstream>

using namespace std;

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

int n;
int v[500005];

void Citire();
void MergeSort(int st, int dr);
void Merge(int st, int mijl, int dr);
void Afisare();

int main()
{
    Citire();
    MergeSort(1, n);
    Afisare();

    return 0;
}

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

void MergeSort(int st, int dr)
{
    if(st < dr)
    {
        int mijl = (st + dr) / 2;
        MergeSort(st, mijl);
        MergeSort(mijl + 1, dr);
        Merge(st, mijl, dr);
    }
}

void Merge(int st, int mijl, int dr)
{
    int i, j, k;
    int n1 = mijl - st + 1;
    int n2 = dr - mijl;
    int v1[n1], v2[n2];
    for(i = 1; i <= n1; i++)
        v1[i] = v[st + i - 1];
    for(i = 1; i <= n2; i++)
        v2[i] = v[mijl + i];
    i = j = 1;
    k = st;
    while(i <= n1 && j <= n2)
    {
        if(v1[i] <= v2[j])
        {
            v[k] = v1[i];
            i++;
        }
        else
        {
            v[k] = v2[j];
            j++;
        }
        k++;
    }
    while(i <= n1)
    {
        v[k] = v1[i];
        i++;
        k++;
    }
    while(j <= n2)
    {
        v[k] = v2[j];
        j++;
        k++;
    }
}

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