#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;
    }
}

int deleteval(int val){
    if(head == NULL)
    return 0;
    
    Node *first = head;
    Node *second = head->next;
    
    if(head->data == val){
        Node *temp = head;
        head = head->next;
        free(temp);
        
        if(head==NULL)
        tail= NULL;
        
        return 1;
    }
    while (second != NULL){
        if(second-> data == val){
            first->next = second->next;
        if(second == tail)
           tail = first;
        free(second);
        return 1;
           
    }
    first = first->next;
    second = second -> next;
}
return 0;

    
}

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