#include<iostream>

using namespace std;

const int N = 100010;

int A[N], B[N];

void mergesort(int l, int r){
    if(l >= r)return;
    int mid = l + r >> 1;
    mergesort(l, mid);
    mergesort(mid + 1, r);
    int k = 0, i = l,j = mid + 1;
    while(i <= mid && j <= r){
        if(A[i] < A[j])B[k++] = A[i++];
        else B[k++] = A[j++];
    }
    while(i <= mid)B[k++] = A[i++];
    while(j <= r)B[k++] = A[j++];
    for(int a = l, b = 0;a <= r;a ++, b++)A[a] = B[b];
}

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