#include <fstream>
using namespace std;
ifstream fin("algsort.in");
ofstream fout("algsort.out");

void merge(int arr[], int p, int q, int r) {

    int n1 = q - p + 1;
    int n2 = r - q;

    int L[n1], M[n2];

    for (int i = 0; i < n1; i++)
        L[i] = arr[p + i];
    for (int j = 0; j < n2; j++)
        M[j] = arr[q + 1 + j];

    // i=primul vector , j = al doilea , k = cel sortat
    int i, j, k;
    i = 0;
    j = 0;
    k = p;

    //pana la golirea unui vector
    while (i < n1 && j < n2) {
        if (L[i] <= M[j]) {
            arr[k] = L[i];
            i++;
        } else {
            arr[k] = M[j];
            j++;
        }
        k++;
    }


    while (i < n1) {
        arr[k] = L[i];
        i++;
        k++;
    }

    while (j < n2) {
        arr[k] = M[j];
        j++;
        k++;
    }
}
void mergeSort(int array[], int const begin, int const end)
{
    if (begin >= end)
        return; 
  
    auto mid = begin + (end - begin) / 2;
    mergeSort(array, begin, mid);
    mergeSort(array, mid + 1, end);
    merge(array, begin, mid, end);
}
  

// print
void printArray(int A[], int size)
{
    for (auto i = 0; i < size; i++)
        fout << A[i] << " ";
}

int main()
{
    int v[500005],n;
    fin>>n;
    for(int i=0; i<n; i++)
        fin>>v[i];

    mergeSort(v, 0, n - 1);
    for(int i=0; i<n; i++)
        fout<<v[i]<<" ";
    return 0;
}