#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;

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

const int maxN = 500005;

int v[maxN];

int main()
{
    int n; fin >> n;

    for(int i = 1; i <= n; ++i) {
        fin >> v[i];
    }

    sort(v+1, v+n+1);

    for(int i = 1; i <= n; ++i) {
        fout << v[i] << " ";
    }

    return 0;
}