#include<fstream>
#include<algorithm>
using namespace std;
ifstream f("okey.in");
ofstream g("okey.out");
int solve[1001],z;
struct nod{
    int nr;
    nod *st,*dr;
};
int criteriu(int a,int b)
{
    return a>b;
}
int creare(nod* &p)
{
    int x;
    f>>x;
    if(x==0) p=NULL;
    else{
        p=new nod;
        p->nr=x;
        creare(p->st);
        creare(p->dr);
    }
}
void parcurgere(nod *p)
{
    if(p->st!=NULL or p->dr!=NULL)
    {
        solve[++z]=p->nr;
        if(p->st!=NULL)
            parcurgere(p->st);
        if(p->dr!=NULL)
            parcurgere(p->dr);
    }
}
int main()
{
    nod* r=NULL;
    creare(r);
    parcurgere(r);
    sort(solve+1,solve+1+z,criteriu);
    for(int i=1;i<=z;i++)
        g<<solve[i]<<" ";
    return 0;
}