#include <iostream>
#include <fstream>
#define nmax 500005
using namespace std;

int n, v[nmax], aux;

/*void insert_sort(int x, int p){
    int nr=p;
    if(v[nr]<x){
        nr++;
        v[nr]=x;
    }
    else{
        int i=nr;
        while(v[i]>=x && i>=1){
            v[i+1] = v[i];
            v[i] = x;
            i--;
        }
        nr++;
    }
}*/

int main()
{
    ifstream f("algsort.in");
    f >> n;
    for(int i=1; i<=n; i++){
        f >> v[i];
        //insert_sort(v[i], i);
    }
    for(int i=1; i<n; i++)
        for(int j=i+1; j<=n; j++)
            if(v[i]>v[j]){
                aux=v[j];
                v[j]=v[i];
                v[i]=aux;
            }
    ofstream g("algsort.out");
    for(int i=1; i<=n; i++)
        g << v[i] <<  " ";
    return 0;
}