#include <iostream>
#include <fstream>
#include <algorithm>

using namespace std;

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

long long m[500003];
int n;

void inssort() {
    for(int i = 0; i < n; i++) {
        int p = i-1;
        while(p != -1 && m[p] > m[p+1]) {
            swap(m[p+1], m[p]);
            p--;
        }
    }
}

int main() {

    in >> n;

    for(int i = 0; i < n; i++)
        in >> m[i];

    inssort();

    for(int i = 0; i < n; i++)
        out << m[i] << " ";

    return 0;
}