#include <bits/stdc++.h>

using namespace std;

ifstream in ("algsort.in");
ofstream out ("algsort.out");

int n, x;//, v[500005];
vector <int> v;

int main()
{
    in >> n;
    /*for (int i=1; i<=n; i++)
        in >> v[i];
    sort(v+1,v+1+n);
    for (int i=1; i<=n; i++)
        out << v[i] << " ";*/
    for (int i=0; i<n; i++)
    {
        in >> x;
        v.push_back(x);
    }
    sort(v.begin(),v.end());
    for (int i=0; i<n; i++)
        out << v[i] << " ";
    return 0;
}