/*#include<iostream>
#include<algorithm>
using namespace std;
int n;
int a[100005];
int main()
{
        cin>>n;
        for(int i=1;i<=n;i++){
                cin>>a[i];
        }
        sort(a+1,a+n+1);
        for(int i=1;i<=n;i++){
                cout<<a[i]<<' ';
        }
        return 0;
} */
#include <stdio.h>
void quicksort(int left, int right);
int n;
int a[100005];
int main() {
    scanf("%d", &n);

    for (int i = 1; i <= n; i++) {
        scanf("%d", &a[i]);
    }
    quicksort(1, n);
    for (int i = 1; i <= n; i++) {
        printf("%d ", a[i]);
    }
    return 0;
}
void quicksort(int l, int r) {
    if (l >= r)
        return;

    int pivot = a[l];
    int left = l, right = r;
    while (left < right) {
        while (left < right && a[right] >= pivot) right--;
        if (left < right)
            a[left] = a[right];
        while (left < right && a[left] <= pivot) left++;
        if (left < right)
            a[right] = a[left];
        if (left >= right)
            a[right] = pivot;
    }

    quicksort(l, right - 1);
    quicksort(left + 1, r);
}