include[HTML_REMOVED]
void quick_sort(int q[],int l,int r){
int x=q[(l+r)/2];
int i=l-1,j=r+1;
if(i>j)return;
while(i[HTML_REMOVED]x);
if(i<j){
int temp=q[i];
q[i]=q[j];
q[j]=temp;
}
}
quick_sort(q,l,j),quick_sort(q,j+1,r);
}
int main(){
int i,n;
scanf(“%d”,&n);
int a[100000];
for(i=0;i<n;i){
scanf(“%d”,&a[i]);
}
quick_sort(a,0,n-1);
for(i=0;i<n;i){
printf(“%d”,a[i]);
}
return 0;
}