#include<stdio.h>
#include<stdlib.h>
typedef struct node{
    int data;
    struct node *next;
    struct node *prev;
}node;
node *head=NULL,*tall;
void create(int num){
    node*newnode=(node*) malloc (1*sizeof(node));
    newnode->data=num;
    newnode->next=NULL;
    if(head==NULL){
        head=newnode;
        tail=newnode;
        
    }
    else{
        newnode->prev=tail;
        tail->next=newnode;
        tail=newnode;
    }
    
}
voiod deletion(int val){
    iter =head->next;
    if(head->data==val){
        head=head->next;
        head->prev=NULL;
    }
    else if(tail->data==val)
    tail->prev->next=NULL;
    else{
        while(iter!NULL){
            if(iter->data==val){
                iter->next->prev=iter->prev;
                iter->prev>next=iter->next;
                break;
                
            }
            
            iter=iter->next;
        }
    }
}
void display(){
    node*itr;
    for(itr=head;itr!NULL;itr->next);
    printf("%d"&itr->data);
}
int main(){
    int size,itr,num,val;
    scanf("%d"&size);
     for(itr=1;itr<size;itr++){
         scanf("%d",&num);
         crerate(num);
     }
     scanf("%d",val);
     del
     
    if(size<0){
        printf("Node not found");
        return 0;
        
    }
   
        
    }
}