#include <bits/stdc++.h>

using namespace std;

void quicksort(int A[], int l, int r)
{
    if (l >= r)
        return;

    int i = l, j = r;
    int p = A[l + rand() % (r - l + 1)];

    do
    {
        while (A[i] < p) i++;
        while (A[j] > p) j--;

        if (i <= j)
        {
            swap(A[i], A[j]);

            i++;
            j--;
        }

    } while (i < j);

    quicksort(A, i, r);
    quicksort(A, l, j);
}

const int MAX_N = 500000 + 1;

int A[MAX_N];
int N;

int main()
{
    srand(time(nullptr));

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

    in >> N;

    for (int i = 0; i < N; ++i)
        in >> A[i];

    quicksort(A, 0, N - 1);

    for (int i = 0; i < N; ++i)
        out << A[i] << " ";

    return 0;
}