#include <stdio.h>

long a[500100];
long n,i;

int oszt(long b, long j, long &k)
{
 long t;   
 t=a[b];
 k=b;
 while(b<j)
 {
   while(b<j && a[j]>=a[k]) --j;
   a[k]=a[j];
   k=j;
   while(b<j && a[b]<=a[k]) ++b;
   a[k]=a[b];
   k=b;          
 }
 a[k]=t;
 return 0;   
}

int quick(long bal, long jobb)
{
 long koz;   
 if(bal<jobb)
 {
  oszt(bal,jobb,koz);
  quick(bal,koz-1);
  quick(koz+1,jobb);
 }   
 return 0;
}

int main()
{
 freopen("algsort.in","r",stdin); 
 freopen("algsort.out","w",stdout);
 
 scanf("%d\n",&n);
 for(i=1;i<=n;++i)
 {
  scanf("%d ",&a[i]);
 }  
 
 quick(1,n);
    
 for(i=1;i<=n;++i)
 {
  printf("%d ",a[i]);
 }       
    
 return 0;    
}