#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;
ifstream fin ("algsort.in");
ofstream fout ("algsort.out");

vector <int> v;
vector <int>::iterator it;

int n,x;

int main () {

    fin>>n;
    while (n--){
        fin>>x;
        v.push_back(x);
    }

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

    for (it=v.begin();it<v.end();it++)
        fout<<*it<<" ";
    fout<<"\n";

    return 0;
}