// editor1
#include<stdio.h>
#include<stdlib.h>
typedef struct Node{
    int data;
    struct Node*prev;
    struct Node*next;
}node;

node*head=NULL,*tail;
void create(int num){
    node*newnode=(node*)malloc(1*sizeof(node));
    newnode->data=num;
    newnode->prev=NULL;
    newnode->next=NULL;
    if(head==NULL){
        head=newnode;
        tail=newnode;
    }
    else{
        newnode->prev=tail;
        tail->next=newnode;
        tail=newnode;
    }
}

void delete(int val){
 node*curr=head->next,*prev=head;

 if(head==NULL){
     printf("Node not found");
     return 0;
 }
 do{
     if(curr->data==val){
         if(curr==prev){
             free(curr);
             head=NULL;
             return 1;
         }
         prev->next=curr->next;
         if(cur==head)
         head=prev;
         free(curr);
         return 1;
     }
     prev=curr;
     curr=curr->next;

 }while(curr!=head->next);
 printf("Node not found");
 return 0;
}

void display(){
    node*itr;
    for(itr=head;itr!=NULL;itr=itr->next){
        printf("%d",itr->data);
    }
}
int main(){
    int n,num;
    scanf("%d",&n);
    if(n<0){
        printf("Invalid input");
        return 0;
    }
    for(int i=1;i<=size;i++){
        scanf("%d",&num);
        create(num);
    }
    int val;
    delete(val);
    if(!delete(val)){
        printf("Node not found");
    }
    else{
        display();
    }
    return 0;
}