#include <fstream>
#include <map>
#include <vector>
using namespace std;

int x, n;
vector < int > v;
map < int, int > m;

ifstream cin("algsort.in");
ofstream cout("algsort.out");

void newSort()
{
    for(unsigned int i = 0; i < v.size(); i++)
        m[v.at(i)]++;
}

int main()
{
    cin>>n;
    while(cin>>x)
        v.push_back(x);


    newSort();

    for(auto it = m.begin(); it != m.end(); it++)
        while(it->second != 0)
        {
            it->second--;
            cout<<it->first<<' ';
        }
    return 0;
}