include[HTML_REMOVED]

include[HTML_REMOVED]

using namespace std;
const int N = 1e6 + 10;
int n;
int q[N];
void quick_sort(int q[], int l , int r) {
if(l>=r) return ;
int x = q[(l+r)/2],i = l-1,j = r+1;
while(i < j) {
do i++; while(q[i] < x);
do j–; while(q[j] > x);
if(i < j) {
int t = q[i];
q[i] = q[j];
q[j] = t;
}
}// 6 1 2 3 1 4

// printf(“aa%d %d”,i,j);
// printf(“\n”);
quick_sort(q,l,i-1);
quick_sort(q,i,r);
}
int main() {
scanf(“%d”,&n);
for(int i = 0 ; i < n ; i) scanf(“%d”,&q[i]);
quick_sort(q,0,n-1);
// sort(q,q+n);
for(int s = 0 ; s < n ; s) printf(“%d “,q[s]);
return 0;
}