#include<fstream>
using namespace std;
ifstream fin("algsort.in");
ofstream fout("algsort.out");
int n,v[500003],i;
void interclasare(int a[], int s, int d, int m)
{
    int aux[500003],j,c;
    i=s;
    j=m+1;
    c=s-1;
    while(i<=m&&j<=d)
    {
        c++;
        if(a[i]<=a[j])
        {
            aux[c]=a[i];
            i++;
        }
        else
        {
            aux[c]=a[j];
            j++;
        }
    }
    while(i<=m)
    {
        c++;
        aux[c]=a[i];
        i++;
    }
    while(j<=d)
    {
        c++;
        aux[c]=a[j];
        j++;
    }
    for(i=s;i<=d;i++)
    {
        a[i]=aux[i];
    }
}
void mergesort(int a[], int s, int d)
{
    if(s<d)
    {
        int m=(s+d)/2;
        mergesort(a,s,m);
        mergesort(a,m+1,d);
        interclasare(a,s,d,m);
    }
}
int main()
{
    fin>>n;
    for(i=1;i<=n;i++)
    {
        fin>>v[i];
    }
    mergesort(v,1,n);
    for(i=1;i<=n;i++)
    {
        fout<<v[i]<<" ";
    }
    fin.close();
    fout.close();
    return 0;
}