#include <iostream>
#include <fstream>

using namespace std;

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

int v[500001];
int aux[500001];

void mmerge(int v[500001], int st, int dr)
{
    int m = (st + dr) / 2, i, j, k;

    i = st;
    j = m + 1;
    k = st;
    while(i <= m && j <= dr)
    {
        if(v[i] <= v[j])
        {
            aux[k++] = v[i++];
        }
        else
        {
            aux[k++] = v[j++];
        }
    }
    while(i <= m)
    {
        aux[k++] = v[i++];
    }
    while(j <= dr)
    {
        aux[k++] = v[j++];
    }
    for(k = st; k <= dr; k++)
    {
        v[k] = aux[k];
    }
}

void ms(int v[500001], int st, int dr)
{
    if(st == dr)
    {
        return;
    }
    int m = (st + dr) / 2;
    ms(v, st, m);
    ms(v, m + 1, dr);
    mmerge(v, st, dr);
}


int main()
{
    int n;
    fin >> n;
    for(int i = 1; i <= n; i++)
        fin >> v[i];
    fin.close();
    ms(v, 1, n);
    //mmerge(v, st ,dr);
    for (int i = 1; i <= n; i++)
    {
        fout << v[i] << " ";
    }
    fout.close();
    return 0;
}