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

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

int main() {
    int n;
    f >> n;
    vector<int> v;
    for (int i = 0; i < n; i++) {
        int x;
        f >> x;
        v.push_back(x);
    }
    sort(v.begin(),v.end());
    for (int i = 0; i < n; i++) {
        g<<v[i]<<" ";
    }
    return 0;
}