include [HTML_REMOVED]
using namespace std;
const int N=10e6+10;
int n;
int q[N];
void quick_sort(int q[],int left,int right){
if (left>=right) return;
int i = left - 1, j = right + 1, x = q[left + right >> 1];
while(i[HTML_REMOVED]x);
if (i<j) swap(q[i],q[j]);
}
quick_sort(q,left,j);
quick_sort(q,j+1,right);
}
int main(){
scanf(“%d”,&n);
for (int i = 0; i < n; i)
{
scanf(“%d”,&q[i]);
}
quick_sort(q,0,n-1);
for(int i=0;i<n;i){
printf(“%d “,q[i]);
}
//system(“pause”);
return 0;
}