#include <iostream>
#include <fstream>

using namespace std;

ifstream f("algsort.in");
ofstream g("algsort.out");

int n,v[500001],temp[500001],i,j;

void mergesort(int st,int dr)
{
    if(st<dr)
    {
        int m  = (st + dr) / 2;
        mergesort(st,m);
        mergesort(m+1,dr);

        int i=st,j=m+1,k=0;
        while(i<=m && j<=dr)
        {
            if(v[i]<v[j])
                temp[k++]=v[i++];
            else 
                temp[k++]=v[j++];
        }
        while(i<=m) temp[k++] = v[i++];
        while(j<=dr) temp[k++] = v[j++];

        i=st; j=0;
        while(i<=dr) v[i++]=temp[j++];
    }
}

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

    mergesort(0,n-1);
    for(int i=0;i<n;i++) g<<v[i]<<" ";

    return 0;
}