#include <iostream>
#include <cstdlib>
#include <fstream>
#include <algorithm>

using namespace std;

 ifstream fin("algsort.in");
ofstream fout("algsort.out");

const int NLIM = 5e5 + 10;
int N;
int v[NLIM];

int compar( const void* a, const void* b )
{
    int x1 = *(int*)a;
    int x2 = *(int*)b;

    return x1 - x2;
}

int main()
{
    fin >> N;
    for( int i = 0; i < N; ++i )
        fin >> v[i];

    qsort( v, N, sizeof( N ), compar );

    for( int i = 0; i < N; ++i )
        fout << v[i] << " ";

    return 0;
}