#include <algorithm>
#include <climits>
#include <fstream>
using namespace std;

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

unsigned int arb[2000001];
unsigned int n;
unsigned int V[500000];

unsigned int queryTree()
{
    unsigned int node = 2;
    while(node < 2000000 && (arb[node] || arb[node + 1]))
    {
        if(arb[node] == arb[1])
            node *= 2;

        else if(arb[node + 1] == arb[1])
            node = (node + 1) * 2;
    }
    node /= 2;
    if(arb[node] == arb[1])
        return node;
    else if(arb[node] == arb[1])
        return node + 1;
    return 1;
}

void insertTree(unsigned int node, unsigned int x, unsigned int pos, unsigned int left, unsigned int right)
{
    if(left == pos && right == pos)
        arb[node] = x;
    else if(left > pos || right < pos)
        return;
    else{
        unsigned int mij = (left + right) / 2;
        if(pos <= mij)
            insertTree(node * 2, x, pos, left, mij);
        else
            insertTree(node * 2 + 1, x, pos, mij + 1, right);
        arb[node] = min(arb[node * 2], arb[node * 2 + 1]);
    }
}

int main()
{
    fin >> n;
    for(unsigned int i = 0; i < n; ++i)
    {
        fin >> V[i];
        insertTree(1, V[i], i + 1, 1, n);
    }

    for(unsigned int i = 0; i < n; ++i)
    {
        fout << arb[1] << ' ';
        unsigned int aux = queryTree();

        arb[aux] = UINT_MAX;
        aux /= 2;

        while(aux)
        {
            arb[aux] = min(arb[aux * 2], arb[aux * 2 + 1]);
            aux /= 2;
        }
    }

    return 0;
}