#include <fstream>

using namespace std;

ifstream cin("algsort.in");
ofstream cout("algosrt.out");
const int DIM = 500001;

int sir[DIM], aux[DIM];
void ms(int st, int dr);
void mmerge(int st, int dr);
int main()
{
    int n;
    cin >> n;
    for(int i = 1; i <= n; ++i)
    {
        cin >> sir[i];
    }

    ms(1, n);
    for(int i = 1; i <= n; ++i)
        cout << sir[i] << ' ';
    return 0;
}

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

void mmerge(int st, int dr)
{
    int m = (st + dr) / 2;
    int i = st, j = m + 1, k = st;
    while(i <= m && j <= dr)
    {
        if(sir[i] <= sir[j])
        {
            aux[k++] = sir[i++];
        }
        else
        {
            aux[k++] = sir[j++];
        }
    }

    while(i <= m)
        aux[k++] = sir[i++];
    while(j <= dr)
        aux[k++] = sir[j++];

    for(k = st; k <= dr; ++k)
        sir[k] = aux[k];
}