#include <fstream>
#include <ctime>
using namespace std;
int n, v[500100];
 
inline void Swap(int &a, int &b)
{
    if(a == b)
        return;
    a ^= b ^= a ^= b;
}
 
inline void QuickSort(int st, int dr)
{
    if(st >= dr)
        return;
    int i, j, pivot;
    pivot = v[st + rand() % (dr - st + 1)];
    i = st;
    j = dr;
    while(i <= j)
    {
        while(i <= dr && v[i] < pivot)
            i++;
        while(j >= st && v[j] > pivot)
            j--;
        if(i <= j)
        {
            Swap(v[i], v[j]);
            i++;
            j--;
        }
    }
    if(st < j)
        QuickSort(st, j);
    if(i < dr)
        QuickSort(i, dr);
}
 
int main()
{
    int i;
    ifstream fin("algsort.in");
    fin >> n;
    for(i = 1; i <= n; ++i)
        fin >> v[i];
    fin.close();
     
	srand(time(NULL));
    QuickSort(1, n);
     
    ofstream fout("algsort.out");
    for(i = 1; i <= n; ++i)
        fout << v[i] << ' ';
    fout << "\n";
    fout.close();
    return 0;
}