//schimbat MAX
//nu merge uneori
//cleanup
#include <iostream>
#include <fstream>
#include <stdio.h>
#include <algorithm>
#include <time.h>

using namespace std;

#define MAX 500010
/*
void afis(int v[], int st, int dr) {
    for (int i = st; i <= dr; i++) {
        cout << v[i] << " ";
    }

    cout << endl;
}*/

void quicksort(int v[], int st, int dr) {
    printf("quick de %d %d\n", st, dr);
    int pivot = v[rand() % (dr - st) + st];
    //printf("pivot %d\n", pivot);
    int i = st, j = dr, aux;

    //printf("inainte:\n");
    //afis(v, st, dr);

    do {
        while (v[i] < pivot && i < dr) {
            i++;
        }

        while (v[j] > pivot && j > st) {
            j--;
        }

        if (i <= j) {
            //printf("swap de v[%d]=%d si v[%d]=%d\n", i, v[i], j, v[j]);
            aux = v[i];
            v[i] = v[j];
            v[j] = aux;

            i++;
            j--;
            //afis(v, st, dr);
        }
    } while (i <= j);

    //printf("dupa cu pivot %d:\n", pivot);

    //afis(v, st, dr);

    if (st < j) {
        quicksort(v, st, j);
    }

    if (i < dr) {
        quicksort(v, i, dr);
    }
}

int main()
{
    ifstream fin("algsort.in");
    ofstream fout("algsort.out");

    srand(clock());

    int n, v[MAX];

    fin >> n;

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

    quicksort(v, 0, n - 1);

    for (int i = 0; i < n; i++) {
        fout << v[i] << " ";
    }

    fin.close();
    fout.close();

    return 0;
}