#include<fstream>
using namespace std;
ifstream f("algsort.in");
ofstream g("algsort.out");
int a[500005],n;
void quicksort(int l, int r)
{ int i = l-1, j = r; int v = a[r]; int aux;
if (r <= l) return;
for (;;)
{
while (a[++i] < v) ;
while (v < a[--j]) if (j == l) break;
if (i >= j) break;
aux=a[i];a[i]=a[j];a[j]=aux;
}
aux=a[i];a[i]=a[r];a[r]=aux;
quicksort(l, i-1);
quicksort(i+1, r);
}
int main()
{int i;
f>>n;
for(i=1;i<=n;i++) f>>a[i];
quicksort(1,n);
for(i=1;i<=n;i++) g<<a[i]<<" ";
return 0;
}