#include <fstream>
using namespace std;

ifstream f("algsort.in");
ofstream g("algsort.out");

int main(){
    int n, x[1005];
    f  >> n;
    for(int i = 0 ; i < n ; ++ i)
        f >> x[i];
    bool sortat = false;
    while(! sortat)
    {
        sortat = true;
        for(int i = 0 ; i < n - 1 ; i++)
            if(x[i] > x[i+1])
            {
                int aux = x[i];
                x[i] = x[i+1];
                x[i+1] = aux;
                sortat = false;
            }
    }
    for(int i = 0 ; i < n ; ++ i)
        g << x[i] << " ";
    return 0;
}