#include <cstdio>
#include<algorithm>
using namespace std;

FILE *f=fopen("algsort.in", "r");
FILE *g=fopen("algsort.out", "w");

int v[500000], nr;

bool cmp(int a, int b){
    return (a<b);
}

int main()
{
    int n;
    fscanf(f, "%d", &n);
    for(int i=0; i<n; ++i)
        fscanf(f, "%d", &v[i]);
    sort(v, v+n, cmp);
    for(int i=0; i<n; ++i)
        fprintf(g, "%d ", v[i]);
return 0;
}