//#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;
vector<int> v;
ifstream cin("algsort.in");
ofstream cout("algsort.out");
int n,x;
/*void merge_sort(Iter li,Iter ls){
    if(li<ls){
        Iter mij=(li+ls)/2;
        merge_sort(li,mij);
        merge_sort(mij+1,ls);
    }
}*/
int main()
{
    cin>>n;
    for(int i=1;i<=n;i++){
        cin>>x;
        v.push_back(x);
    }
    sort(v.begin(),v.end());
    for(vector<int>::iterator it=v.begin();it!=v.end();it++) {
        cout << *it << ' ';
    }
    return 0;
}