#include <iostream>


using namespace std;

const int N=12;
int drzewo[N] = {12, 7, 19, 3, 9, 15,-1,-1, -1, -1, -1, 14};
//int rootT = ;
void order(int p)
{
    //int i=0;
        if (p >= N)
        return;
    if (drzewo[p] == -1)
        return;

    cout<<drzewo[p]<<" ";
    order(p*2+1);
    order(p*2+2);

}


int main(int argc, char* argv)
{
order(0);

return 0;
}