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

int main ()
{
    int i, x, N;
    fin >> N;
    for (i=1; i<=N; i++)
        {
           fin >> x;
           L.push_back(x);
        }
    sort (L.begin(), L.end());
    for (i=0; i<L.size(); i++)
        fout << L[i] << " ";
    fout << "\n";
    fin.close();
    fout.close();
    return 0;
}