#include <bits/stdc++.h>
using namespace std;

ifstream f("algsort.in");
ofstream g("algsort.out");
#define cin f
#define cout g
const int Max = 5e5 + 1;
int v[Max],tmp[Max];
void MergeSort(int v[], int st, int dr)
{
    if(st < dr)
    {
        int m = (st + dr) / 2;
        MergeSort(v,st,m);
        MergeSort(v,m+1,dr);
        //Interclasare
        int i=st,j=m+1,k=0;
        while(i<=m && j<=dr)
            if(v[i]<v[j])
                tmp[++k]=v[i++];
            else
                tmp[++k]=v[j++];
        while(i<=m)
            tmp[++k]=v[i++];
        while(j<=dr)
            tmp[++k]=v[j++];
        for(i=st,j=1;i<=dr;i++,j++)
            v[i]=tmp[j];
    }
}
int main()
{
	int n;
	f>>n;
	for(int i=1;i<=n;i++)
	    f>>v[i];
	MergeSort(v,1,n);
	for(int i=1;i<=n;i++)
	    g<<v[i]<<' ';


    return 0;
}