#include <iostream>
#include<ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;

template<class key, class value, class cmp = std::less<key>>
using ordered_map = tree<key, value, cmp, rb_tree_tag, tree_order_statistics_node_update>;

ordered_map<int, int> my_map;
int n,x;

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

int main()
{
    fin >> n;
    for(int i = 1; i <= n; i++){
        fin >> x;
        my_map[x]++;
    }
    for(auto [val, cnt]: my_map){
        for(int i = 1; i <= cnt; i++){
            fout << val << " ";
        }
    }
    return 0;
}