//arbint
#include <iostream>
#include <fstream>

using namespace std;

#define MAX 500010
#define INF 2147483647

void carb(int v[], int arb[], int nod, int st, int dr) {
    if (st == dr) {
        arb[nod] = v[st];
    } else {
        int mid = (st + dr) / 2;

        carb(v, arb, 2 * nod, st, mid);
        carb(v, arb, 2 * nod + 1, mid + 1, dr);

        arb[nod] = min(arb[2 * nod], arb[2 * nod + 1]);
    }
}

void update(int arb[], int n) {
    int nod = 1, st = 1, dr = n, mid;

    while (st < dr) {
        mid = (st + dr) / 2;

        if (arb[2 * nod + 1] == arb[nod]) {
            st = mid + 1;
            nod = 2 * nod + 1;
        } else {
            dr = mid;
            nod = 2 * nod;
        }
    }

    int vechi = arb[nod];

    arb[nod] = INF;

    nod /= 2;

    while (nod > 0 && arb[nod] == vechi) {
        arb[nod] = min(arb[2 * nod], arb[2 * nod + 1]);

        nod /= 2;
    }
}

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

    int n, v[MAX], arb[2 * MAX];

    fin >> n;

    for (int i = 1; i <= n; i++) {
        fin >> v[i];
    }

    carb(v, arb, 1, 1, n);

    for (int i = 0; i < n; i++) {
        fout << arb[1] << " ";

        update(arb, n);
    }

    fin.close();
    fout.close();

    return 0;
}