#include<stdio.h>
#include<stdlib.h>

struct Node{
    int data;
    struct Node*next;
};

struct Node* createNode(int value){
    struct Node*newNode=(struct Node*)malloc(sizeof(struct Node));
    newNode->data=value;
    newNode->next=NULL;
    return newNode;
}
void display(struct Node*head){
    if(head == NULL)
        return;
        
    struct Node*temp=head;
    do{
        printf("%d",temp->data);
        temp=temp->next;
    }while(temp!=head);
}
struct Node*delete(struct Node*head,int key){
    if(head == NULL)
    return NULL;
    
    
    struct Node *curr=head,*prev=NULL,*last;
    if(head->data == key){
        struct Node *last=head;
    }
    if(head->next == head){
        free(head);
        return NULL;
    }
    while(last->next!=head){
        last =last->next;
        
        last->next=head->next;
        struct Node*temp=head;
        head=head->next;
        free(temp);
        return head;
    }
    prev=head;
    curr = head->next;
    while(curr != head && curr->data !=key){
        prev=curr;
        curr=curr->next;
    }
    if(curr == head)
        return head;
        
    prev->next = curr->next;
    free(curr);
    return head;
}
int main(){
    int n,x,head;
    scanf("%d",&n);
    struct Node*head=NULL,*temp=NULL,*last=NULL;
    
    for(int i=0;i<n;i++){
        int value;
        scanf("%d",&value);
        struct Node*newNode = createNode(value);
        
        if(head == NULL){
            head = newNode;
            temp = newNode;
        }
        else{
            temp->next=newNode;
            temp = newNode;
        }
        }
        temp->next=head;
        scanf("%d",&x);
        
        struct Node*check =head;
        int found=0;
        do{
            if(check->data == x){
                found = 1;
                break;
            }
            check = check->next;
        }while(check !=head);
    
    if(!found){
        printf("Node not found");
        return 0;
    }
    head=delete(head,x);
    display(head);
    return 0;
    }
    
}