#include <iostream>
#include <fstream>
using namespace std;
ifstream f("algsort.in");
ofstream g("algsort.out");
#define m 2147483648
unsigned int n,arb[2500005],x,mn,i;

void inserare(int nod,int lt,int rt)
{
    if(lt==rt)
    {
        arb[nod]=x;
        return;
    }
    int md=(lt+rt)/2;
    if(i<=md) inserare(nod*2,lt,md);
    else inserare(nod*2+1,md+1,rt);

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

void findmin(int nod,int lt,int rt)
{
    if(lt==rt)
    {
        mn=arb[nod];
        arb[nod]=m;
        return;
    }
    int md=(lt+rt)/2;
    if(arb[nod*2]<=arb[nod*2+1]) findmin(nod*2,lt,md);
    else findmin(nod*2+1,md+1,rt);

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

int main()
{
    f>>n;
    for(i=1;i<=n;++i)
    {
        f>>x;
        inserare(1,1,n);
    }
    for(i=1;i<=n;++i)
    {
        findmin(1,1,n);
        g<<mn<<' ';
    }
    return 0;
}