#include<stdio.h>
#include<stdlib.h>
typedef struct node{
    int data;
    struct node *next;
}node;
node *head=NULL,*tail;
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{
        tail->next=newnode;
        tail=newnode;
    }
}
void del(int val){
    first=head;
    second=head->next;
    if(val==head->data){
        head=head->next;
    }else{
        while(second!=NULL){
            if(second->data==val){
                first->next=second->next;
                break;
            }
            first=first->next;
            second=second->next;
        }
    }
}
void display(){
    node *itr;
    for(itr=head;itr!=NULL;itr=itr->next){
        printf("%d",itr->data);
    }
}
int main(){
    int n,i,val,num;
    scanf("%d",&n);
    if(n==0){
        printf("Node not found");
        return 0;
    }
    for(i=0;i<n;i++){
        scanf("%d",&num);
        create(num);
    }
    scanf("%d",&val);
    del(val);
    if(head==NULL){
        printf("List is empty");
        return 0;
    }
    if(second==NULL){
        printf("Node not found");
    }else{
        display();
        return 0;
    }
}