include[HTML_REMOVED]

using namespace std;
const int MX=100000;
int a[MX+10],temp[MX+10];
void marge_sort(int q[],int l,int r){
if(l>=r) return ;
int mid=r+l>>1;
marge_sort(q,l,mid),marge_sort(q,mid+1,r);
int k=0,i=l,j=mid+1;
while(i<=mid&&j<=r)
if(q[i]>q[j]) temp[k]=q[j];
else temp[k]=q[i];
while(i<=mid) temp[k]=q[i];
while(j<=r) temp[k]=q[j];
for(i=l,j=0;i<=r;i,j) q[i]=temp[j];
}
int main(){
int n;
scanf(“%d”,&n);
for(int i=0;i<n;i)
scanf(“%d”,&a[i]);
marge_sort(a,0,n-1);
for(int i=0;i<n;i)
printf(“%d “,a[i]);
return 0;
}