#include <fstream>

using namespace std;

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

int main(){
    int n; fin >> n;
    int v[n+1] = {0};
    for (int i = 1; i <= n; i++)
        fin >> v[i];
    for (int i = 1; i < n; i++)
        for (int j = i + 1; j <= n; j++)
            if (v[j] < v[i])
                swap(v[j] , v[i]);
    for (int i = 1; i <= n; i++)
        fout << v[i] << ' ';
    return 0;
}