#include<stdio.h>
#include<stdlib.h>
typedef struct node{
    int data;
    struct node*next;
    struct node*prev;
}node;
node*head=NULL,*tail,*prev;
void create(int num){
    node*newNode =(node*)malloc(1*sizeof(node));
    newNode->data=num;
    newNode->next=NULL;
    newNode->prev=NULL;
    if(head==NULL){
        head=newNode;
        tail=newNode;
    }
    else{
        
        tail->next=newNode;
        tail=newNode;
    }
}
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);
        create(num);
    }
    scanf("%d",&val);
    display();
    return 0;
}
    deletion(val);
    if(iter == NULL){
        printf("Node not found");
    }
    else{
        dipslay();
        return 0;
    }
}