#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 deletion(int val){
    first = head;
    second = head->next;
    while(second != NULL){
        if(second->data==val){
            first->next=second->next;
        }
        first = first->next;
        second = second->next;
    }
}

int main(){
    int size,num,itr,val;
    scanf("%d",&size);
    for(itr=1;itr<=size;itr++){
        scanf("%d",&num);
        create(num);
    }
    scanf("%d",val);
    deletion(val);
    if(second==NULL){
        printf("Node not found");
        return 0;
    }
    else{
        display();
    }
    return 0; 
}