#include <fstream>

using namespace std;

ifstream fin("algsort.in");
ofstream fout("algsort.out");

int main()
{
    int n;
    fin>>n;

    int a[n+1];
    for(int i = 1;i<=n;++i) fin>>a[i];

    int lastInd = 0, rightInd = n+1;

    while (rightInd>1) {
        lastInd = 1;
		for (int i = 1; i < rightInd - 1; ++i) {
            if (a[i]>a[i + 1]) {
                int aux = a[i];
                a[i] = a[i + 1];
                a[i + 1] = aux;
				lastInd = i+1;
            }
        }

        rightInd = lastInd;


    }

    for(int i = 1;i<=n;++i)
        fout<<a[i]<<' ';
    fout.close();
    return 0;
}