#include <iostream>
#include <fstream>
using namespace std;
ifstream f("algsort.in");
ofstream g("algsort.out");
int n,v[500001],aux,Sol[500001];
void interclasare(int v[],int low,int mid,int high)
{
    int i=low;
    int j=mid+1;
    int k=low-1;
    while(i<=mid && j<=high)
    {
        if(v[i]<v[j])
            Sol[++k]=v[i++];
        else Sol[++k]=v[j++];
    }

    while(i<=mid)
        Sol[++k]=v[i++];

    while(j<=high)
        Sol[++k]=v[j++];


    for(int i=low; i<=high; i++)
        v[i]=Sol[i];

}
void MergeSort(int v[],int low,int high)
{
    if(low<high)
    {
        int mid=low+(high-low)/2;
        MergeSort(v,low,mid);
        MergeSort(v,mid+1,high);

        interclasare(v,low,mid,high);
    }
}
int main()
{
    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;
}