#include <cstdio>
//#include <vector>
#include <deque>
#include <algorithm>

using namespace std;

int main()
{
    int i, x, N;

    freopen( "algsort.in", "r", stdin );
    freopen( "algsort.out", "w", stdout );

    scanf( "%d", &N );
    deque<int>V;
    deque<int>::iterator it;
    for( i = 0; i < N; i++ )
        scanf( "%d", &x ), V.push_back( x );

    sort(V.begin(),V.end());
   for(it=V.begin(); it!=V.end(); ++it )
        printf( "%d ", *it );

    return 0;
}