#include <cstdio>

using namespace std;
long a[500001],n,i;
void qsort(long l,long r)
{
long ii,jj,x,y;
ii=l;jj=r;x=a[(l+r)/2];
do{
while(a[ii]<x){ii++;}
while(a[jj]>x){jj--;}
if(ii<=jj){
        y=a[ii];a[ii]=a[jj];a[jj]=y;
ii++;jj--;
        }
  }while(ii<=jj);
  if(l<jj){qsort(l,jj);}
  if(ii<r){qsort(ii,r);}
}
int main()
{
freopen("algsort.in","r",stdin);
freopen("algsort.out","w",stdout);
scanf("%ld",&n);
for (i=1; i<=n; i++)
    scanf("%ld",&a[i]);
qsort(1,n);
for (i=1; i<=n; i++)
    printf("%ld ",a[i]);
return 0;
}