#include <fstream>

using namespace std;

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

int v[500005];

void quick_sort(int st, int dr)
{
    int i = st, j = dr;
    int x = v[rand()% (dr-st+1) + st];
    while(i < j)
    {
        while(v[i] < x) i++;
        while(v[j] > x) j--;
        if(i <= j) swap(v[i++], v[j--]);
    }
    if(j > st) quick_sort(st, j);
    if(i < dr) quick_sort(i, dr);
}

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