#include <cstdio>
#include <algorithm>
 
using namespace std;
 
#define MAX_N 500000
 
int v[MAX_N];
 
void read( FILE *fin, int &n ) {
    fscanf( fin, "%d", &n );
    for ( int i = 0; i < n; ++i )
        fscanf( fin, "%d", &v[i] );
}
 
int main() {
    FILE *fin, *fout;
 
    fin = fopen( "algsort.in", "r" );
    int n;
    read( fin, n );
    fclose( fin );
 
    sort( v, v + n );
 
    fout = fopen( "algsort.out", "w" );
    for ( int i = 0; i < n; ++i )
        fprintf( fout, "%d ", v[i] );
    fclose( fout );
}