#include <iostream>

using namespace std;
const int N = 1e5+10;
int q[N];
void quick_sort(int q[],int l,int r){
    if(l>=r) return;//边界条件

    int x = q[(l+r)/2],i = l-1, j = r + 1;//1.确定分界点x=q[(l+r)/2]
    while(i < j){//2.划分两个区域，左半区域的数满足于等于x的性质，右边区域满足大于等于x的性质
        do i++; while(q[i] < x);
        do j--; while(q[j] > x);
        if(i < j) swap(q[i],q[j]);
    }
    quick_sort(q,l,j);//3.递归处理左、右半区域
    quick_sort(q,j+1,r);

}
int main(){
    int n;
    scanf("%d",&n);
    for(int i = 0; i < n; i++){
        scanf("%d",&q[i]);
    }
    quick_sort(q,0,n-1);
    for(int i = 0; i < n; i++){
        printf("%d ",q[i]);
    }

}