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

using namespace std;

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

vector < int > merge(vector < int > a, vector < int > b) {
    vector < int > c;
    while (!a.empty() && !b.empty()) {
        if (a[0] > b[0]) {
            c.emplace_back(b[0]);
            b.erase(b.begin());
        }
        else {
            c.emplace_back(a[0]);
            a.erase(a.begin());
        }
    }

    while (!a.empty()) {
        c.emplace_back(a[0]);
        a.erase(a.begin());
    }

    while (!b.empty()) {
        c.emplace_back(b[0]);
        b.erase(b.begin());
    }

    return c;
}

vector < int > merge_sort(vector < int > v) {
    if (v.size() == 1) return v;
    vector < int > v1;
    vector < int > v2;
    for (auto it = v.begin(); it != v.begin() + v.size() / 2; ++it) {
        v1.emplace_back(*it);
    }
    for (auto it = v.begin() + v.size() / 2; it != v.end(); ++it) {
        v2.emplace_back(*it);
    }

    v1 = merge_sort(v1);
    v2 = merge_sort(v2);

    return merge(v1, v2);
}

int n;

int main() {
    f >> n;
    vector < int > v(n);
    for (auto &it : v) {
      f >> it;
    }
    v = merge_sort(v);
    for (auto &it : v) {
        g << it << " ";
    }
}