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

using namespace std;

#ifdef LOCAL
ifstream fin("input.txt");
#define fout cout
#else
ifstream fin("algsort.in");
ofstream fout("algsort.out");
#define endl '\n'
#endif

const int NMAX = 5e5+5;

int n;
int a[NMAX];

int main() {
    fin >> n;
    for (int i = 1; i <= n; i++)
        fin >> a[i];
    sort(a + 1, a + n + 1);
    for (int i = 1; i <= n; i++)
        fout << a[i] << ' ';
    return 0;
}