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