#include <fstream>
#include <queue>
#include <bits/stdc++.h>
using namespace std;
bool cmp(int a,int b){
    return (a<b);
}
priority_queue <int,vector<int>,greater<int> >q;
ifstream in("algsort.in");
ofstream out("algsort.out");
int main()
{
    int n,aux;
    in>>n;
    for(int i=1;i<=n;i++)
        in>>aux,q.push(aux);
    for(int i=1;i<=n;i++)
        out<<q.top()<<" ",q.pop();
    return 0;
}