#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
int v[500000], i, n;
bool cmp (const int &x, const int &y)
{
    return x<y;
}
int main()
{
    FILE *f=fopen("algsort.in", "r");
    FILE *g=fopen("algsort.out", "w");
    fscanf(f, "%d", &n);
    for(i=0; i<n; i++)
        fscanf(f, "%d", &v[i]);
    sort(v, v+n, cmp);
    for(i=0; i<n; i++)
        fprintf(g, "%d ", v[i]);
    fclose(f);
    fclose(g);
    return 0;
}