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

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

Node *head =NULL,*tail;


void create(int num){
    Node *newnode=(Node*)malloc(1 * sizeod(Node));
    newnode -> data = num;
    newnode -> next = NULL;
    if(head==NULL){
        head=newnode;
        tail=newnode;
        
    }
    else{
        tail ->next = newnode;
        tail = newnode;
        
    }
}

void display(){
    Node*itr;
    for(itr=head;itr!=NULL;itr=itr->next){
    printf(itr->data);
    }
}

void delet(int pos){
    Node *First= head;
    Node *second=head->next;
    
    int cnt=1;
    while(1){
        int(cnt == pos){
            First ->next=Second->next;
            break;
            
        }
        First=First->next;
        Second=Second->next;
        cnt++;
        
        
    }
}
    
    int main(){
        int num,size,i;
        int pos;
        scanf("%d",size);
        
        if(size<=0){
            printf("Invalid input");
            return 0;
        }
        for(int itr=1;itr<=size;itr++){
            if(!scanf("%d",&num));
            create(num);
            
        }
        scanf("%d",&pos);
        if(pos<1 || pos>=size){
            printf("Invalid input");
            return 0;
        }
        delet(pos);
        display();
        return 0;
    }