#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;
ifstream f("algosort.in");
ofstream g("algosort.out");
struct solver
{
    int n; /// numarul de elemente
    vector<int> v; /// vectorul
    solver()
    {
        f>>n;
        for(int i=1;i<=n;i++)
        {
            int x;
            f>>x;
            v.push_back(x);
        }
        sort(v.begin(),v.end());
        for(auto it:v)
            g<<it<<' ';
        g<<'\n';
    }
};
solver S;
int main()
{
    return 0;
}