include[HTML_REMOVED]

include[HTML_REMOVED]

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