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