#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;
    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;
    }
}

Node *temp,*prev;
void deleteAtMid(int pos){
    int i;
    if(head==NULL){
        printf("Invalid input");
        return 0;
    }
    temp = head;
    for(i=1;i<=pos;i++){
        prev = temp;
        temp = temp->next;
    }
    prev->next=temp->next;
    free(temp);
}

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

int main(){
    int size,num,itr,pos;
    scanf("%d\n",&size);
    if(size<0){
        printf("Invalid input");
        return 0;
    }
    for(itr=1;itr<=size;itr++){
        if(!scanf("%d\n",&num)){
            printf("Invalid input");
            return 0;
        }
        create(num);
    }
    scanf("%d",&pos);
    if(pos>size){
        printf("Invalid input");
        return 0;
    }
    deleteAtMid(pos);
    display();
    return 0;
}