#include <stdio.h>
#include <stdlib.h>
typedef struct Node{
    int data;
    struct Node* next;
}Node;

Node *head=NULL, *tail;

void create(int num){
    Node *new=(Node*)malloc(1*sizeof(Node));
    new->data = num;
    new->next = NULL;
    
    if(head==NULL){
        head = new;
        tail = new;
    }
    else{
        tail->next =new;
        tail=new;
    }
}

void deletion(int val){
    Node *first = head;
    Node *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 *i;
    for(i=head;i!=NULL;i=i->next){
        printf("%d",i->data);
    }
}

int main(){
    int n, val, i, num;
    scanf("%d",&n);
    if(n<=0){
        printf("Invalid input");
        return 0;
    }
    
    for(i=1;i<=n;i++){
        if(!(scanf("%d",&num))){
            printf("Invalid input");
        }
        create(num);
    }
    
    scanf("%d",&val);
    deletion(val);
    if(second==NULL){
        printf("Not Found");
    }
    else{
        display();
    }
    return 0;
}