#include <iostream>
#include <vector>
#include <algorithm>
#include <random>
#include <ctime>
#include <ratio>
#include <chrono>
#include <fstream>

using namespace std;

vector<int> sortare(vector<int> Vector){
    int Max = *max_element(Vector.begin(), Vector.end());
    vector<int> freq;
    for(int i=0; i<=Max; i++){
        freq.push_back(0);
    }
    for(int i=0; i<Vector.size(); i++){
        freq[Vector[i]]++;
    }
    vector<int> newVector = {};
    for(int i=0; i<freq.size(); i++){
        while(freq[i] > 0){
            newVector.push_back(i);
            freq[i]-=1;
        }
    }
    return newVector;
}

int main(){
    ifstream f("algsort.in");
    ofstream g("algsort.out");
    vector<int> V;
    int a, N;
    f>>N;
    while(N>0){
        f>>a;
        V.push_back(a);
        N--;
    }
    V = sortare(V);
    for(long unsigned int i=0; i<V.size(); i++){
        g<<V[i]<<" ";
    }
    return 0;
}