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