#include <fstream>

using namespace std;

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

const int M = 500000;

int v[M], n;

int main()
{
    in >> n;

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

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

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

    return 0;
}