#include<stdio.h>
#include<stdlib.h>

typedef struct number{
    int data;
    struct number *next;
}reno;

reno *head = NULL, *tail;
reno *first, *second;

void create(int num){
    reno *newNode = (reno*) malloc (1 * sizeof(reno));
    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(){
    reno *it;
    for(it=head;it!=NULL;it=it->next){
        printf("%d ",it->data);
    }
}

int main(){
    int size,itr,num,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);
    del(val);
    
    if(head=NULL){
        printf("List is empty");
        return 0;
    }
    
    if(second == NULL){
        printf("Not Found");
        return 0;
    }
    else{
        display();

    return 0;
}