#include <fstream>
using namespace std;
ifstream f("algsort.in");
ofstream g("algsort.out");
int n, i, j, aux;
int main()
{
    f >> n;
    int v[n+1];
    for(i = 1; i <= n; i++)
        f >> v[i];
    for(i = 1; i < n; i++)
        for(j = i+1; j <= n; j++)
            if(v[i] > v[j]) {
                aux = v[i];
                v[i] = v[j];
                v[j] = aux;
            }
    for(i = 1; i <= n; i++) {
        g << v[i] << ' ';
    }
    return 0;
}