#include <cstdio>
#include <algorithm>

#define NX 500010

using namespace std;

int N, A[NX], B[NX];

bool cmp(int a, int b)
{
    return (a <= b ? true : false);
}

int main() {
    int i;

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

    scanf( "%d", &N );
    for( i = 1; i <= N; i++ )
        scanf( "%d", &A[i] );

   sort(A + 1, A + N + 1, cmp);

    for( i = 1; i <= N; i++ )
        printf( "%d ", A[i] );

    return 0;
}