#include <fstream>
#include <algorithm>
using namespace std;
 
ifstream fin("algsort.in");
ofstream fout("algsort.out");
 
int i, mx, N;
int v[500001], H[500001];
 
void UP_heap(int u) {
    while (u != 1 && H[u] < H[u / 2]) swap(H[u], H[u / 2]), u /= 2;
}
 
void DOWN_heap(int u) {
    while (u * 2 <= N) {
        if (H[u * 2] < H[u * 2 + 1]) 
            swap(H[u], H[u * 2]), u *= 2;
        else
            swap(H[u], H[u * 2 + 1]), u = u * 2 + 1;
    }
    swap(H[u], H[N]);
    H[N] = mx + 1;
    --N;
}
 
int main() {
    fin >> N;
    for (i = 1; i <= N; ++i) {
        fin >> H[i];
        mx = max(H[i], mx);
        UP_heap(i);
    }
    H[N + 1] = mx + 1;
    while (N) {
        fout << H[1] << ' ';
        DOWN_heap(1);
    }
    fout << '\n';
    return 0;
}