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

using namespace std;
vector<int> v;
int n, i, x;
int main () {
    ifstream fin ("algsort.in");
    ofstream fout("algsort.out");

    fin>>n;
    for (int i=1;i<=n;i++) {
        fin>>x;
        v.push_back(x);
    }

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

    for (i=0;i<v.size();i++)
        fout<<v[i]<<" ";
    return 0;
}