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

using namespace std;

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

vector <int> v;
int n;

int main()
{
    fin>>n;
    int x;
    for (int i=0; i<n; i++)
    {
        fin >> x;
        v.push_back(x);
    }
    sort(v.begin(),v.end());
    for (vector <int> ::iterator it=v.begin(); it!=v.end(); it++)
        fout << *it << " ";
    return 0;
}