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