#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("algsort.in");
ofstream fout("algsort.out");
/*
int* MergeSort(int a[], int b[], int n, int m)
{
    int i=0, j=0, c[n+m], k=0;
    while (i < n && j < m)
    {
        if (a[i] < b[j])
            c[k++] = a[i++];
        else c[k++] = b[j++];
    }
    while (i < n)
        c[k++] = a[i++];
    while (j < m)
        c[k++] = b[j++];
    return c;
}

int* merge_sort(int v[], int n)
{
    if (n<=1)
        return v;
    else {
        int stanga[n/2+1], dreapta[n/2+1];
        for (int i=0; i<n/2; i++) {
            stanga[i] = v[i];
            dreapta[i] = v[n/2+i+1];
        }
        merge_sort(stanga, n/2);
        merge_sort(dreapta, n/2);

        MergeSort(stanga, dreapta, n/2, n/2);
    }
}
*/

int merging (int a[], int low, int mid, int high)
{
   int i, j, k, b[high+1];

   for(i = low, j = mid + 1, k = low; i <= mid && j <= high; k++) {
      if(a[i] <= a[j])      /// lucrez doar pe vectorul a cu 2 jumatati: de la low la mid si de la mid la high si pun in b elementele in ordine cresc.
         b[k] = a[i++];     // b merge de la low la high
      else
         b[k] = a[j++];
   }

   while(i <= mid)
      b[k++] = a[i++];

   while(j <= high)
      b[k++] = a[j++];

   for(int i = low; i <= high; i++)
      a[i] = b[i];          /// pun b-ul inapoi in a
    return *b;
}

int sorting (int v[], int low, int high)
{
    if(low < high)
    {
        int mid = (low + high) / 2;
        sorting (v, low, mid);
        sorting (v, mid+1, high);
        return merging(v, low, mid, high);
    }
    else return *v;
}

int main()
{
    int n;  fin>>n;
    int v[n];

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

    sorting(v, 0, n);

    for (int i=1; i<=n; i++)
        fout << v[i] << " ";

    return 0;
}