#include<stdio.h>
#include<stdlib.h>
typedef struct node{
    int data;
    struct node *next;
}Node;
Node *head=NULL;
void insert(int v){
    Node *newnode=(Node*)malloc(sizeof(Node));
    newnode->data=v;
    if(head==NULL){
        newnode->next=newnode;
        head=newnode;
    }
    else{
        newnode->next=head->next;
        head->next=newnode;
        head=newnode;
    }
}

int found=0;
void deletev(int v){
    if(head==NULL)return;
    Node* temp=head;
    if(temp->data==v){
        found=1;
        head=temp->next;
        free(temp);
    }
    else{
        printf("-1");
    }
}
void display(){
    Node *temp=head->next;
    do{
        printf("%d",temp->data);
        temp=temp->next;
    }
    while(temp!=head->next);
}
int main(){
    int n,num,v;
    scanf("%d",&n);
    for(int i=0;i<n;i++){
        scanf("%d",&num);
        create(num);
    }
    scanf("%d",&v);
    
    deletev(v);
    display();
    return 0;
}