#include<bits/stdc++.h> using namespace std; int le; int a[100000]; void kuaipai(int i,int j) { int m,n,temp,k; m=1;n=j; k=a[(i+j)/2]; while (m<=n) { while (a[m]<k&&m<j) m++; while (a[n]>k&&n>1) n--; if (m<=n) { swap(a[m],a[n]); m++;n--; } } if (m<j) kuaipai(m,j); if (n>i) kuaipai(i,n); } int main() { cin>>le; for (int q=1;q<=le;q++) { cin>>a[q]; } kuaipai(1,le); for (int l=1;l<=le;l++) { cout<<a[l]<<" "; } return 0; }