//分治递归思想
#include <iostream>
using namespace std;
const int N = 1e5 + 10;
int q[N],tmp[N];
void merge_sort(int q[],int l,int r){
    if(l >= r)  return;
    int mid = l + r >> 1;
    merge_sort(q,l,mid);
    merge_sort(q,mid + 1,r);//排序过程
    int k = 0,i = l,j = mid + 1;
    while(i <= mid && j <= r){//归并过程
        if(q[i] <= q[j])    tmp[k++] = q[i++];
        else    tmp[k++] = q[j++];
    }
    while(i <= mid) tmp[k++] = q[i++];
    while(j <= r)   tmp[k++] = q[j++];
    for(i = l,j = 0;i <= r;++i,++j) q[i] = tmp[j];//放入原来数组
}

int main(){
    int n;
    cin >> n;
    for(int i = 0;i < n;++i){
        cin >> q[i];
    }
    merge_sort(q,0,n - 1);
    for(int i = 0;i < n;++i){
        cout << q[i] << ' ';
    }
    cout << endl;
    return 0;
}