```cpp
#include <iostream>
using namespace std;
const int N=1000086;
int a[N],tmp[N];
int n;
void merge_sort(int a[],int l,int r)
{
if(l>=r)return;
int mid=(r+l)/2;//确定分界点
merge_sort(a,l,mid), merge_sort(a,mid+1,r);//递归分解排序左右两段
int k=0,i=l,j=mid+1;
while(i<=mid&&j<=r)//读写头移动比较两段,较小者读入临时数组
{
if(a[i]<=a[j])tmp[k++]=a[i++];
else tmp[k++]=a[j++];
}
while(i<=mid)tmp[k++]=a[i++];//剩下的按顺序全部移入临时数组
while(j<=r)tmp[k++]=a[j++];
for(i=l,j=0;i<=r;i++,j++)a[i]=tmp[j];//临时数组返回
}
int main()
{
scanf("%d",&n);
for(int i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
merge_sort(a,0,n-1);
for(int i=0;i<n;i++)
{
printf("%d ",a[i]);
}
return 0;
}