#include <bits/stdc++.h>

using namespace std;


int n;
int arr[500005];
int auxArr[500005];

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 Cut (int arr[], int left, int right) {
    srand(time(0));
    int pivot = left + rand() % (right - left + 1);
    int pos = left - 1;
    for (int i = left; i <= right; i++) {
        if (arr[i] < pivot) {
            pos++;
            swap(arr[pos], arr[i]);
        }
    }
    swap(arr[pos + 1], arr[right]);
    return pos + 1;
}


void QuickSort(int arr[], int left, int right) {
    if (left >= right)
        return;
    int mid = Cut(arr, left, right);
    QuickSort(arr, left, mid - 1);
    QuickSort(arr, mid + 1, right);
}

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