#include<stdio.h>
#include<stdlib.h>
int size=5,top=-1;
int isfull()
{
    if(top==size-1)
        return 1;
    else
        return 0;
}
void enqueue(int num)
{
    if(isfull())
      printf("queue is full");
      else
      arr[++top]=num;
}
int isempty()
{
    if(top==-1)
       return 1;
    else
      return 0;
}
void dequeue()
{
    if(isempty())
       printf("queue is full");
    else
    {
        printf("%d",arr[0]);
        for(int i=0;i<=top;i++)
         arr[i]=arr[i+1];
         top--;
    }
}
void insert(int pos,int val)
{
    if(isfull())
        printf("queue is full");
    else
     {
         for(int i=top;i>=top;i--)
         {
             arr[i+1]=arr[i];
         }
         arr[pos]=val;
         top++;
     }
}
void display()
{
    for(int i=0;i<=top;i++)
    {
        printf("%d",arr[i]);
    }
}
int main()
{
    int i,num,pos,val;
    scanf("%d",&size);
    for(i=1;i<=size;i++)
    {
        scanf("%d",&num);
        enqueue(num);
    }
    scanf("%d%d",&pos,&val);
    insert(pos,val);
    display();
}