#include <fstream>
#include <vector>
#include <algorithm>

using namespace std;

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

vector<int> v;

int main()
{
    int n, x;
    f >> n;

    for(int i = 0; i < n; ++i){
        f >> x;
        v.push_back(x);
    }

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

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

    f.close();
    g.close();
    return 0;
}