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

using namespace std;

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

int n;
int i, x;
vector <int> v;

int main()
{
    
    fin >> n;
    
    for (i=1; i<=n; i++)
        fin >> x,
        v.push_back(x);
    
    sort(v.begin(), v.end());
    
    for (i=0; i<n; i++)
        fout << v[i] << " ";
    
    fout << "\n";
    
    return 0;
}