#include<stdio.h>
#include<algorithm>
#include<ctype.h>

using namespace std;

#define buff 1000
char s[buff];
int k,n, a[500050];
void r(int &val)
{
     while( !isdigit(s[k] ) )
     {
            if( ++k == buff)
            {
                k=0;
                fread( s,1, buff , stdin);
            }
            }
     val =0;
     while(isdigit( s[k] ))
     {
             
             val = val*10 + s [ k ] - '0';       
            if( ++k == buff)
            {
                k=0;
                fread( s,1, buff , stdin);
            }
                    }
}
void read()
{
     r( n) ;
     for(int i=1 ;i<=n;i++)
             r ( a[i] ) ;
}
void afis ()
{
     for(int i=1 ;i<=n;i++)
     printf("%d ", a[i] );
}
int main ()
{
    freopen("algsort.in","r",stdin);
    freopen("algsort.out","w",stdout);
    read();
    sort(a+1 , a+n+1 );
    afis ();
return 0;
}