include[HTML_REMOVED]
include[HTML_REMOVED]
using namespace std;
const int N=1e5+6;
int q[N],tmp[N];
void merge_sort(int q[],int l,int r){
if(l>=r)return;
int mid=l+r>>1;
merge_sort(q,l,mid);
merge_sort(q,mid+1,r);
int i=l,j=mid+1,k=0;
while(i<=mid||j<=r){
int ql=i<=mid?q[i]:INT_MAX;
int qr=j<=r?q[j]:INT_MAX;
if(ql<=qr)tmp[k]=q[i];
else tmp[k]=q[j];
}
for(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(q,0,n-1);
for(int i=0;i<n;i)printf(“%d “,q[i]);
return 0;
}