#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(sizeof(node));
    newnode->data =num;
    newnode->next =NULL;
    if(head==NULL){
        head=newnode;
        tail=newnode;
    }
    else{
        tail->next=newnode;
        tail=newnode;
    }
}
node *first ,*second;
void deleteVal(int Val){
  first=head;
  second=head->next;
 if(Val==head->data){
    head=head->next;
}
 while(second!=NULL){
        if(second->data==Val){
            first->next=second->next;
            break;
        }
        first=second;
        second=second->next;
    }

}
void display(){
 node *itr;
    for(itr=head;itr!=NULL;itr=itr->next){
    printf("%d",itr->data);
}
int main(){
    int num,size,val;
    scanf("%d",&size);
    for(int i=0;i<size;i++){
        scanf("%d",&num);
     create(num);
    }
    scanf("%d",&val);
    deleteVal(val);
    if(head==NULL){
        printf("List is empty");
        return 0;
    }
    if(second==NULL){
        printf("Not found");
        return 0;
    }
    display();
    return 0;
}
}