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

using namespace std;

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

int n, x;
vector<int> v;

void read() {
    fin >> n;
    for(int i = 1; i <= n; ++i)
    {
        fin >> x;
        v.emplace_back(x);
    }
}

void solve() {
    sort(v.begin(), v.end());
}

void write() {
    for(vector<int> :: iterator it = v.begin(); it != v.end(); ++it)
        fout << *it << " ";
}

int main() {

    read();
    solve();
    write();
    return 0;
}