include [HTML_REMOVED]

using namespace std;
const int N = 100010;
void quick_sort(int q[],int l,int r){
if(l == r){
return ;
}
int i = l - 1,j = r + 1,x = q[(l + r) >> 1];
while(i < j){
do i; while(q[i][HTML_REMOVED]x);
if(i < j){
swap(q[i],q[j]);
}
}
quick_sort(q,l,j);
quick_sort(q,j+1,r);
}
int main(){
int n;
scanf(“%d”,&n);
int a[N];
for(int i=0;i[HTML_REMOVED]> a[i];
}
quick_sort(a,0,n-1);
for(int i=0;i<n;i){
printf(“%d “,a[i]);
}
return 0;
}