#include<fstream>
#include<vector>
#include<algorithm>
#include<queue>

#define NMAX 500005

using namespace std;

ifstream fin("algsort.in");
ofstream fout("algsort.out");

priority_queue< int,vector<int>,greater<int> > HEAP;
int n,x;

int main()
{
    fin>>n;
    for(int i=0;i<n;i++)
    {
        fin>>x;
        HEAP.push(x);
    }
    for(;!HEAP.empty();HEAP.pop())
        fout<<HEAP.top()<<' ';
    fin.close();
    fout.close();
    return 0;
}