#include <iostream>
#include <fstream>
#include <string.h>
using namespace std;
ifstream f("algsort.in");
ofstream g("algsort.out");
void merge(int array[], int left, int mid, int right)
{
    int n = mid - left + 1;
    int m = right - mid;
    int *v1 = new int[n],
         *v2 = new int[m];
    for (int i = 0; i < n; i++)
        v1[i] = array[left + i];
    for (int j = 0; j < subArrayTwo; j++)
        v2[j] = array[mid + 1 + j];

    int i = 0,
        j = 0;
    int k = left;
    while (i < n && j < m) {
        if (leftArray[i] <= rightArray[j]) {
            array[k] = leftArray[i];
            i++;
        }
        else {
            array[k] = rightArray[j];
            j++;
        }
        k++;
    }
    while (i < n) {
        array[k] = leftArray[i];
        i++;
        k++;
    }
    while (j < m) {
        array[k] = rightArray[j];
        j++;
        k++;
    }
}

void mergeSort(int array[], int begin, int end)
{
    if (begin >= end)
        return;

    int mid = begin + (end - begin) / 2;
    mergeSort(array, begin, mid);
    mergeSort(array, mid + 1, end);
    merge(array, begin, mid, end);
}

int main()
{
    int arr[500000],n;
    f>>n;
    for(int i=0;i<n;i++)
        f>>arr[i];
    mergeSort(arr, 0, n - 1);
    for(int i=0;i<n;i++)
        g<<arr[i]<<" ";
    return 0;
}