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

using namespace std;

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

    int N;
    fin >> N;

    vector<int> numbers(N);
    for (int i = 0; i < N; i++) {
        fin >> numbers[i];
    }

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

    for (int i = 0; i < N; i++) {
        fout << numbers[i] << " ";
    }
    fout << endl;

    fin.close();
    fout.close();

    return 0;
}