#include<stdio.h>
#include<stdlib.h>
struct Node{
    int data;
    struct Node*next;
};
int main(){
    int n,x,i;
    scanf("%d",&n);
    struct Node*head=NULL,*temp,*newNode;
    for(i=0;i<n;i++){
        newNode=malloc(sizeof(struct Node));
        scanf("%d",&newNode->data);
        newNode->next=NULL;
        if(!head)head=newNode;
        else temp->next=newNode;
        temp=newNode;
    }
    scanf("%d",&x);
    struct NOde8curr=head,*prev=NULL;
    while(curr&&curr->data!=x){
        prev=curr;
        curr=curr->next;
    }
    if(!curr){
        printf("Node not found");
        return 0;
    }
    if(!prev)head=curr->next;
    else prev->next=curr->next;
    free(curr);
    for (temp=head;temp;temp=temp->next)
    printf("%d ",temp->data);
    return 0;
}