#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;
    }
}
node *first, *second;

void deleteval(int val){
first=head;
second=head->next;
if(head ->data==val){
    head=head->next;
    //break;
}
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 size,num;
    scanf("%d",&size);
    for(size==0)){
       printf("Not Found");
       return 0;
    }
    for(i=0;i<=size;i++){
        scanf("%d",&num);
        create(num);
    }
    int value;
    scanf("%d",&value);
    deleteval(value);
    if(head==NULL){
        printf("List is empty");
        return 0;
    }
    if(second=NULL){
        printf("Not Found");
    }
    else
      display();
    return 0;
}