#include <fstream>
#include <queue>
#include <vector>
using namespace std;
ifstream cin("algsort.in");
ofstream cout("algsort.out");
int n,x;
priority_queue<int,vector<int>,greater<int>>h;
int main()
{
    cin>>n;
    for(int i=1;i<=n;i++){
        cin>>x;
        h.push(x);
    }
    for(int i=1;i<=n;i++){
        cout<<h.top()<<" ";
        h.pop();
    }
    return 0;
}