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

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

Node*head=NULL,*tail;

void create(int num){
    Node*newNode = (Node*) malloc(1* sizeof(newNode));
    
    newNode->data=num;
    newNode->next=NULL;
    
    if(head==NULL){
        head = newNode;
        tail = newNode;
    }
    else{
        tail->next=newNode;
        tail = newNode;
    }
    
}
void display(){
    Node*itr;
    while(itr!=NULL){
        printf("%d",itr->data);
        itr=itr->next;
    }
}

void insertion(){
    int val,pos,itr,size;
    
    if(pos == 1){
        newNode->next=head;
        head = newNode;
    }
    else if(size+1 == pos){
        tail->next = newNode;
        tail = newNode;
    }
     else{
         int cnt = 1;
         Node *itr=head;
         while(1){
             if(cnt+1 == pos){
                 newNode->next=itr->next;
                 itr->next=newNode;
             }
         }
     }
}
int main(){
    int size,val,num,itr,pos;
    scanf("%d",&size);
    printf("Invalid input");
    return 0;
    
    for(itr=1;itr>=size;itr++){
        scanf("%d",&num);
        create(num);
    }
    scanf("%d %d",&val ,&pos);
    if(pos<1 || pos>size+1){
        printf("Invalid input");
        return 0;
    }
    insertion();
    display();
    return 0;
}