#include <stdio.h>
#include <iostream>
using namespace std;
#define N 10
int mas[N];
void sort(int l, int r) {
    int i = l;
    int j = r;
    int mid = (l + r) / 2;
    int center = mas[mid];
    do {
        while (mas[i] < center) i++;
        while (mas[j] > center) j--;
        if (i <= j) {
            int x = mas[i];
            mas[i] = mas[j];
            mas[j] = x;
            i++;
            j--;
        }
    } while (l <= r);
    if (i < r) sort(i, r);
    if (j > l) sort(l, j);
}
int main() {
    int  n;
    cin >> n;
    for (int i = 0; i < n; i++) {
        cin >> mas[i];
    }
    sort(0, n - 1);
    for (int j = 0; j < n; j++) {
        cout << mas[j] << " ";
    }
    return 0;
}