#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;
ifstream in("algsort.in");
ofstream out("algsort.out");

int main() {
    int n, x;
    vector<int> v;
    in >> n;
    for(int i = 0; i < n; i++) {
        in >> x;
        v.push_back(x);
    }
    sort(v.begin(), v.end());
    for(int i = 0; i < n; i++)
        out << v[i] << ' ' ;
    return 0;
}