#include <fstream>
#include <vector>
using namespace std;

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

int main()
{
    int n, x;
    vector<int> v;
    // citesc vectorul
    fin >> n;
    for(size_t i = 0; i < n; i++)
    {
        fin >> x;
        v.push_back(x);
    }

    bool schimb = true;
    while(schimb)
    {
        schimb = false;
        for(size_t i = 0; i < n-1; i++)
        {
            if(v[i] > v[i+1])
            {
                swap(v[i], v[i+1]);
                schimb = 1;
            }
        }
    }
    // afisez vectorul sortat
    for(size_t i = 0; i < n; i++)
        fout << v[i] << " ";
    return 0;
}