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

int main() {
    int i, n;
    ifstream f("algsort.in");
    f >> n;
    vector<int> v(n + 1);
    for (i = 1; i <= n; i++)
        f >> v[i];
    f.close();
    sort(v.begin(), v.end());
    ofstream g("algsort.out");
    for (i = 1; i <= n; i++)
        g << v[i] << ' ';
    g.close();
    return 0;
}