#include <stdio.h>
#include <algorithm>
using namespace std;

int v[500001];

int main()
{
    FILE *fin, *fout;

    fin = fopen("algsort.in", "r");
    fout = fopen("algsort.out", "w");

    int n;

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

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

    sort(v + 1, v + n + 1);

    for(int i = 1; i <= n; i++)
        fprintf(fout, "%d ", v[i]);

    return 0;
}