#include <iostream>
#include <fstream>

#define nMax 500000

using namespace std;

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

int v[nMax], aux[nMax];

void merge(int v[], int left, int mid, int right, int aux[]){
    int i=left, j=mid + 1,pos =0;
    while(i <= mid && j<=right){
        if(v[i]<v[j])
            aux[pos++]=v[i++];
        else
            aux[pos++]=v[j++];
    }
    while(i<=mid)
        aux[pos++] = v[i++];
    while(j<=right)
        aux[pos++] = v[j++];
    for(i=0; i < pos ; i++)
        v[left+i] = aux[i];

}

int mergesort(int v[], int left, int right, int aux[]){
    if(left == right)
        return 0;

    int mid = (left + right) / 2;

    mergesort(v, left, mid, aux);
    mergesort(v, mid + 1, right, aux);
    merge(v, left, mid, right, aux);

}

int main()
{
    int n;
    fin>>n;

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

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

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

    return 0;
}