#include <iostream>
#include<fstream>
#include<stdlib.h>
using namespace std;
ifstream f("algsort.in");
ofstream g("algsort.out");
int comp(const void *a, const void *b)
{
    if(*(long *)a>*(long*)b)
        return 1;
    else
        if(*(long*)a<*(long *)b) return -1;
    return 0;
}
int main()
{
    int n,i, v[500000];
    f>>n;
    for(i=0;i<n;i++)
        f>>v[i];
    qsort(v,n,sizeof(v[0]),comp);
    for(i=0;i<n;i++)
        g<<v[i]<<" ";
    return 0;
}