#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;
ifstream fin("algsort.in");
ofstream fout("algsort.out");
int main()
{
    int n, x;
    vector<int>v;
    fin>>n;
    for(int i=0;i<n;++i)
    {
        fin>>x;
        v.push_back(x);
    }
    sort(v.begin(), v.end());
    for(int e:v)
        fout<<e<<" ";
    return 0;
}