#include<stdio.h>
#include<stdlib.h>
typedef struct TreeNode{
    int data;
    struct TreeNode *left;
    struct TreeNode *right;
}node;
node*  root=NULL;
node *create(int num){
    node *newnode=(node*)malloc(sizeof(node));
    newnode->data=num;
    newnode->left=newnode->right=NULL;
    return newnode;
}
node* insert(node* root,int num,val){
    if(root==NULL)
    return create(num);
    if(root->data<val)
      root->left=insert(root->left,num);  
    else
      root->right=insert(root->right,num);
   return root;
}

void lvl(node* root,temp){
    if(root==NULL)return;
    node *queue[100]
    front=rear=0;
    queue[rear++]=root;
    while(front<rear){
        node *curr=queue[front++];
        printf("%d ",curr->data);
        if(curr->left){
            queue[rear++]=curr->left;
        if(curr->right)
            queue[rear++]=curr->right;
        }
      }
}
int main(){
    int n,num;
    scanf("%d",&n);
    if(n<0){
        printf("Invalid input");
        return 0;
    }
    for(int i=0;i<n;i++){
        scanf("%d",&num);
    }
    int x;
    scanf("%d",&x);
    for(int i=0;i<=n;i++){
        return 0;
    }
}