#include<stdio.h>
#include<stdlib.h>
typedef struct Node{
    int data;
    struct Node*next;
}Node;
Node*createNode(int data){
    Node*newNode = (Node*)malloc(sizeof(Node));
    newNode->data = data;
    newNode->next = NULL;
    return newNode;
}
Node*insertAtPosition(Node*head,int value, int pos,int n){
    if(pos<1||pos>n+1){
        printf("Invalid input\n");
        exit(0);
    }
    Node*newNode = createNode(value);
    if(pos==1){
        newNode->next = head;
        return newNode;
    }
    Node*temp = head;
    for(int i = 1;i<pos-1;i++){
        temp=temp->next;
    }
    newNode->next = temp->next;
    temp->next=newNode;
    return head;
}
void printList(Node*head){
    Node*temp = head;
    while(temp!=NULL){
        printf("%d",temp->data);
        temp = temp->next;
    }
    printf("\n");
}
int main(){
    int n;
    scanf("%d",&n);
    Node* head = NULL;
    Node* tail = NULL;
    for(int i=0;i<n;i++){
        int value;
        scanf("%d",&value);
        Node* newNode = createNode(value);
        if(head == NULL){
            head = tail=newNode;
        }else{
            tail->next = newNode;
            tail = newNode;
        }
    }
    int insertvalue,pos;
    scanf("%d",&insertvalue);
    scanf("%d",&pos);
    head = insertAtPosition(head,insertvalue,pos,n);
    printList("\t",head);
    return 0;
}