#include<stdio.h>
#include<stdlib.h>
typedef struct node
{
    int data;
    struct node *next ,*prev, *iter;
}Node;
Node *head=NULL, *tail, *first,*second;
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;
    }
}
void display()
{
    Node *itr;
    for(itr=head;itr!=NULL;itr=itr->next);
    {
        printf("%d ",itr->data);
    }
}
void deletion(int val)
{
    first=head;
    second=head->next;
    if(head->data==val)
    {
        head=head->next;
    }

    else
    {
        while(second!=NULL)
        if(second->data==val)
        {
           first->next=second->next;
           break;
        }
        first=first->next;
        second=second->next;
    }
}
int main()
{
    int size,i,num,val;
    scanf("%d",&size);
    if(size<0)
    {
        printf("Invalid input");
        return 0;
    }
    for(i=0;i<size;i++)
    {
        scanf("%d",&num);
        create(num);
    }
    scanf("%d",&val);
    deletion(val);
    if(second==NULL)
    {
        printf("Node not found");
    }
    else
    {
        display();
    }
    return 0;
}