#include <fstream>
#include <set>
#include <algorithm>

using namespace std;
multiset<int> s;
multiset<int>::iterator it;

int n, i, x;


int main(){
    ifstream fin("algsort.in");
    ofstream fout("algsort.out");
    fin>>n;
    for (i=1;i<=n;i++) {
        fin>>x;
        s.insert(x);
    }

//    sort(v.begin(), v.end());

    for (it = s.begin(); it!=s.end(); it++)
        fout<<*it<<" ";
/*
    for (i=0;i<v.size();i++)
        fout<<v[i]<<" ";
*/
return 0;
}