#include <iostream>
#include <algorithm>

using namespace std;

const int NMAX = 500000;
int v[NMAX];

int main()
{
    FILE *fin, *fout;
    fin = fopen("algsort.in", "r");
    fout = fopen("algsort.out", "w");

    int n;
    fscanf(fin, "%d", &n);

    for (int i = 0; i < n; i++)
        fscanf(fin, "%d", &v[i]);

    // lene, din pacate, apelam quicksort din stl
    sort(v, v + n);

    for (int i = 0; i < n; i++)
        fprintf(fout, "%d ", v[i]);
    
    fclose(fin);
    fclose(fout);
    return 0;
}