// editor1
#include<stdio.h>
#include<stdlib.h>
 typedef struct node{
    int data;
    struct node *prev;
    struct node *next;
}nd;
nd *head=NULL;
void insert(int val){
    nd *newnode=(nd*)malloc(1*sizeof(nd));
    newnode->data=num;
  
if(head==NULL){
    newnode->next=newnode;
    newnode->prev=newnode;
    head=newnode;
}else{
    nd *last=head->prev;
    newnode->prev=last;
    newnode->next=head;
    last->next=newnode;
    head->prev=newnode;
}
}
void delete(int x){
    if(head==NULL){
        printf("Node not found");
        return;
    }
    nd *temp=head;
    do{
        if(temp->data==x){
            if(temp->next==temp){
                head=NULL;
            }else{
                temp->prev->next=temp->next;
                temp->next->prev=temp->prev;
                if(temp==head)
                head=temp->next;
            }
        free(temp);
        return;
    }
    temp=temp->next;
    
}while(temp!=head);
printf("Node not found");
}


void display(){
  if(head==NULL){
      return ;
      nd *temp=head;
      do{
          printf("%d",temp->data);
          temp=temp->next;
      }while(temp!=head);
  }
int main(){
    int n,val,x;
    scanf("%d",&n);
    if(n<=0)
{
    printf("Invalid input");
    return 0;
}
for(int i=0;i<n;i++){
    scanf("%d",&val);
    insert(val);
}
scanf("%d",&x);
delete(x);
if(head!=NULL);
display();
return 0;
}