#include <iostream>
#include <fstream>
#define nmax 500000
using namespace std;
ifstream fin("algsort.in");
ofstream fout("algsort.out");
int n,v[nmax+5];
void quicksort(int left,int right)
{
    int i=left,j=right,tmp;
    int pivot=v[(left+right)/2];
    while(i<=j)
        {while(v[i]<pivot)
        i++;
        while(v[j]>pivot)
        j--;
        if(i<=j)
        {
            tmp=v[i];
            v[i]=v[j];
            v[j]=tmp;
            i++;
            j--;
        }}
    if(left<j)
        quicksort(left,j);
    if(right>i)
        quicksort(i,right);
}
int main()
{
    fin>>n;
    for(int i=1;i<=n;i++)
        fin>>v[i];
    quicksort(1,n);
    for(int i=1;i<=n;i++)
        fout<<v[i]<<" ";
    return 0;
}