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

using namespace std;

const int NMAX = 5e5;

int v[NMAX];

FILE *fin, *fout;

int numar() {
    char ch;
    int nr;
    while ( isspace( ch = fgetc( fin ) ) );
    nr = ch - '0';
    while ( isdigit( ch = fgetc( fin ) ) )
        nr = nr * 10 + ch - '0';
    return nr;
}
int main() {
    fin = fopen( "algsort.in", "r" );
    fout = fopen( "algsort.out", "w" );
    int n, i;
    n = numar();
    for ( i = 0; i < n; i ++ ) {
        v[i] = numar();
    }
    sort( v, v + n );
    for ( i = 0; i < n; i ++ ) {
        fprintf( fout, "%d ", v[i] );
    }
    return 0;
}