//分而治之 快速排序
//确定分界点 调整区间 递归
//注意边界性问题 取i+j>>1最好

include[HTML_REMOVED]

include[HTML_REMOVED]

using namespace std;
const int N = 1000100;

int n;
int q[N];

void quick_sort(int q[], int l,int r){
if(l >= r) return;
int x = q[(l+r+1)/2],i = l - 1,j = r + 1;
while(i < j){
do i++;while(q[i] < x);
do j–;while(q[j] > x);
if(i < j) swap(q[i],q[j]);
}

quick_sort(q,l,i-1),
quick_sort(q,i,r);

}

int main(){
cin>>n;
for(int i = 0;i < n;i++){
cin>>q[i];
}

quick_sort(q,0,n-1);

for(int i=0;i<n;i++){
    cout<<q[i]<<" ";
}
return 0;

}