#include <iostream>

using namespace std;

int a[10000],v[10000];

void mergesort(int left,int right)
{
    if (left<right)

{
        int mid=(left+right)/2;
    mergesort(left,mid);
    mergesort(mid+1,right);

    int i=left, j=mid+1,k=0;

    while(i<=mid && j<=right)
    {
        if(v[i]<v[j])
            a[++k]=v[i++];
        else
            a[++k]=v[j++];

    }

    while(i<=mid)
        a[++k]=v[i++];
    while(j<=right)
        a[++k]=v[j++];

    for(i=left,j=1;i<=right;i++,j++)
        v[i]=a[j];
}


}

int main()
{

    int i,n;

    cin>>n;

    for (i=0;i<n;i++)
        cin>>v[i];

    mergesort(0,n-1);

    for (i=0;i<n;i++)
        cout<<v[i]<<" ";

    return 0;
}