include[HTML_REMOVED]

int bingui(int a[],int l,int m,int r)
{
int i,j,k;
int n1=m-l+1;
int n2=r-m;
int L[n1],R[n2];
for(i=0;i<n1;i) L[i]=a[l+i] ;
for(j=0;j<n2;j) R[j]=a[m+1+j];

i=0;j=0;k=l;
while(i<n1 && j<n2)
{
    if(L[i]<=R[j]){
        a[k]=L[i];i++;k++; 
    }else{
        a[k]=R[j];j++;
    k++;} 
}while(i<n1){
    a[k]=L[i];i++;k++;
}while(j<n2){
    a[k]=R[j];j++;k++;
}

}
void sortt(int a[],int l,int r)
{
if(l<r){
int m=l+(r-l)/2;
sortt(a,l,m);sortt(a,m+1,r);
bingui(a,l,m,r);
}
}
int main()
{
int n,i;
scanf(“%d”,&n);
int a[n];
for(i=0;i<n;i){
scanf(“%d”,&a[i]);
}
sortt(a,0,n-1);
for(i=0;i<n;i){
printf(“%d “,a[i]);
}
return 0;
}