//归并排序
#include<iostream>

using namespace std;
int a[1000010],n;
void merset_sort(int q[],int l,int r){
    if(l>=r)return;//边界线
    int mid=l+r>>1;
    merset_sort(q,l,mid);
    merset_sort(q,mid+1,r);//以中点为界限分两个数组
    int i=l,k=0,j=mid+1,res[r-l+1];
    while(i<=mid&&j<=r)
        if(q[i]<=q[j])res[k++]=q[i++];
            else res[k++]=q[j++];
    while(i<=mid)res[k++]=q[i++];
    while(j<=r)res[k++]=q[j++];
    for(int i=l,k=0;i<=r;i++,k++)q[i]=res[k];
}
int main(){
    cin>>n;
    for(int i=0;i<n;i++)scanf("%d",&a[i]);
    merset_sort(a,0,n-1);
    for(int i=0;i<n;i++)printf("%d ",a[i]);
}