#include <bits/stdc++.h>

using namespace std;

const int MaxN = 500005;

int n;
int arr[MaxN];
int auxArr[MaxN];

ifstream fin ("algsort.in");
ofstream fout ("algsort.out");

void MergeSort(int arr[], int left, int right) {
    if (left >= right) {
        return;
    }
    int mid = left + (right - left) / 2;
    MergeSort(arr, left, mid);
    MergeSort(arr, mid + 1, right);
    int i = left;
    int j = mid + 1;
    int k = 0;
    while (i <= mid && j <= right) {
        if (arr[i] <= arr[j]) {
            auxArr[k++] = arr[i];
            i++;
        }
        else {
            auxArr[k++] = arr[j];
            j++;
        }
    }
    while (i <= mid) {
        auxArr[k++] = arr[i];
        i++;
    }
    while (j <= right) {
        auxArr[k++] = arr[j];
        j++;
    }
    for (int i = 0; i < k; i++)
        arr[left + i] = auxArr[i];
}

int main()
{
    fin >> n;
    for (int i = 0; i < n; i++)
        fin >> arr[i];
    MergeSort(arr, 0, n - 1);
    for (int i = 0; i < n; i++)
        fout << arr[i] << " ";
    return 0;
}