#include <fstream>

using namespace std;

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

const int M = 500000;

int n, v[M];

int main()
{
    in >> n;

    for(int i = 1; i <= n; i++)
        in >> v[i];

    for(int i = 1; i <= n; i++)
    {
        for(int j = 1; j <= n-i; j++)
        {
            if(v[j] > v[j+1])
                swap(v[j], v[j+1]);
        }

    }

    for(int i = 1; i <= n; i++)
        out << v[i] << " ";

    return 0;
}