#include <bits/stdc++.h>
using namespace std;

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


int partition(int A[], int low, int high)
{
    int var,pivot,i,j;
    pivot=A[low];
    i=low;
    j=high;
    while(i<j)
    {
        do
    {
        i++;
    }while(A[i]<pivot);
    do
    {
        j--;
    }while(A[j]>pivot);
    if(i<j)
    {
        var=A[i];
        A[i]=A[j];
        A[j]=var;
    }
    }
    var=A[low];
    A[low]=A[j];
    A[j]=var;
    return j;
}
void qsort(int A[], int low, int high)
{
    int j;
    if(low<high)
    {
        j=partition(A,low,high);
        qsort(A,low,j);
        qsort(A,j+1,high);
    }
}
int main()
{
    int A[500005],i,n;
    f>>n;
    for(i=1;i<=n;i++)
    {
        f>>A[i];
    }
    qsort(A,1,i);
    for(i=1;i<=n;i++)
    {
        g<<A[i]<<" ";
    }
    return 0;
}