#include<stdio.h>
#include<stdlib.h>
typedef struct node{
    int data;
    struct node *left;
    struct node *right;
}Node;
Node *root=NULL;
Node* create(int val){
    Node *newnode=(Node*)malloc(sizeof(Node));
    newnode->data=val;
    newnode->left=newnode->right=NULL;
    return newnode;
}
Node* buildtree(int arr[],int n,int i){
    if(i>=n)
        return NULL;
    Node *root=create(arr[i]);
    root->left=buildtree(arr,n,2*i+1);
    root->right=buildtree(arr,n,2*i+2);
    return root;
}
void levelorder(Node* root){
    if(root==NULL)
        return;
    Node *queue[200];
    int front=0,rear=0;
    queue[rear++]=root;
    while(front<root){
        Node *temp=queue[front++];
        printf("%d ",temp->data);
        if(temp->left!=NULL)
            queue[rear++]=temp->left;
        if(temp->right!=NULL)
            queue[rear++]=temp->right;
    }
}
int main(){
    int n;
    scanf("%d",&n);
    if(n<0){
        printf("Invalid input");
        return 0;
    }
    int arr[n];
    for(int i=0;i<n;i++){
        scanf("%d",&arr[i]);
        Node *root=buildtree(arr,n,0);
    }
    levelorder(root);
    return 0;
}