#include <stdio.h>
#include <queue>
using namespace std;
int N;
int main()
{
    priority_queue<int> heap;
    FILE*f = fopen("algsort.in","r");
    fscanf(f,"%d",&N);
    int x;
    for(int i=1;i<=N;++i)
    {
        fscanf(f,"%d",&x);
        heap.push(-x);
    }
    fclose(f);
    FILE*g = fopen("algsort.out","w");
    for(int i=1;i<=N;++i)
    {
        fprintf(g,"%d ", (heap.top()) * -1);
        heap.pop();
    }
    fclose(g);
    return 0;
}