#include <iostream>
#include <fstream>

using namespace std;

const int NMax = 500010;

int N;
int a[NMax];

int main()
{
    ifstream f ("algsort.in");
    f >> N;
    for (int i = 1; i <= N; ++ i)
        f >> a[i];
    f.close();
    int last;
    for (int i = 2; i <= N; i = last + 1)
    {
        last = N;
        for (int j = N; j >= i; -- j)
        {
            if (a[j-1] > a[j])
            {
                swap(a[j], a[j-1]);
                last = j;
            }
        }
    }
    ofstream g ("algsort.out");
    for (int i = 1; i <= N; ++ i)
        g << a[i] << " ";
    g.close();
    return 0;
}