#include <fstream>
#include <cstdlib>

using namespace std;

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

void citire(int v[], int &n)
{
    f >> n;
    for(int i = 1; i <= n; i++)
        f >> v[i];
    f.close();
}

void afis(int v[], int n)
{
    for(int i = 1; i <= n; i++)
        g << v[i] << ' ';
}

//Bubble Sort

int main()
{
    int n, v[500001];
    citire(v, n);
    int nrit;
    do
    {
        nrit = 0;
        for(int i = 1; i < n; i++)
            if(v[i] > v[i + 1])
            {
                int aux = v[i];
                v[i] = v[i + 1];
                v[i + 1] = aux;
                nrit++;
            }

    }
    while(nrit != 0);
    afis(v, n);
    return 0;
}

/*
//QuickSort

void qsort(int v[], int st, int dr)
{
    //int random = st + (rand())%(dr - st);
    int p = v[st];
    int vs[101], vd[101], nrst = 0, nrdr = 0;
    for(int i = st; i <= dr; i++)
    {
       if(v[i] < p)
            vs[++nrst] = v[i];
        else {
            if(v[i] != p)
                vd[++nrdr] = v[i];
        }
    }
    qsort(vs, 1, nrst);
    qsort(vd, 1, nrdr);
}

int main()
{
    int n, v[101];
    citire(v, n);
    qsort(v, 1, n);
    afis(v, n);
    g.close();
    return 0;
}
*/