#include<stdio.h>
#include<stdlib.h>
typedef struct node
{
    int data;
    struct node*next;
}Node;
Node*head=NULL,*tail;
Node*first,*second;
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;
    }
}

void deletion(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(){
        node*i;
        for(i=head;i!=NULL;i=i->next){
            printf("%d ",i->data);
        }
    }
int main()
{
    int n,i,num,val;
    scanf("%d",&n);
    if(n<0)
    {
        printf("Invalid input");
        return 0;
    }
    for(i=0;i<=n;i++)
    {
        scanf("%d",&val);
        create(num);
    }
    scanf("%d",&val);
    deletion(val);
    if(second==NULL)
    {
        printf("Node not found");
        return 0;
    }
    else{
        display();
    }
}