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

#define IN "algsort.in"
#define OUT "algsort.out"

vector<int> v;

int main() {

    int n, i, x;

    ifstream fin(IN); ofstream fout(OUT);

    fin >> n;

    for(i = 0; i < n; ++i) {

        fin >> x;
        v.push_back(x);
    }

    sort(v.begin(), v.end());

    for(i = 0; i < n; ++i)
        fout << v[i] << ' ';
    fout << '\n';

    return 0;
}