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(l>=r) return;
int x=q[l+r>>1];
int i=l-1;
int j=r+1;
while(i < j){
do i ++;while(q[i][HTML_REMOVED]x);
if(i<j) swap(q[i],q[j]);
}
quicksort(q,l,j);
quicksort(q,j+1,r);
}

int main(){
int i;
scanf(“%d”,&n);
for(i=0;i<n;i){
scanf(“%d”,&q[i]);
}
quicksort(q,0,n-1);
for(i=0;i<n;i){
printf(“%d “,q[i]);
}
return 0;
}