#include <iostream>
#include <algorithm>
#include <fstream>

#include <vector>

using namespace std;

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

int n;

vector <int> v;

int main()
{
    int i, j;
    f>>n;

    for (i=1; i<=n; i++)
    {
        f>>j;
        v.push_back(j);
    }

    //sort(v+1, v+n+1);
    sort( v.begin(), v.end() );

    for (i=0; i<n; i++) g<<v[i]<<" ";
    return 0;
}