#include<iostream>
using namespace std;

const int N =100010;
int q[N],tmp[N];

void merge_sort(int l,int r)
{
    if(l>=r) return;
    int mid = l+r >> 1;
    merge_sort(l,mid);
    merge_sort(mid+1,r);

    //归并
    int i=l,j=mid+1,k=0;
    while(i<=mid && j<=r)
    {
        if(q[i]<=q[j]) tmp[k++] =  q[i++];
        else tmp[k++] = q[j++];
    }

    //扫尾
    while(i<=mid) tmp[k++] = q[i++];
    while(j<=r) tmp[k++] = q[j++];

    //物归原主
    for(int i=l,j=0;i<=r;i++,j++) q[i] = tmp[j];


}

int main()
{
    int n;
    scanf("%d",&n);
    for(int i=0;i<n;i++) scanf("%d",q+i);
    merge_sort(0,n-1);
    for(int i=0;i<n;i++) cout << q[i] << " ";
    return 0;
}