#include<stdio.h>

int top = -1,size = 4;
int arr[4];

int isfull(){
    if(top == size-1)
        return 1;
    else
        return 0;
}



void enqueue(int num){
    if(isfull){
        printf("Queue is full");
        return;
    }
    arr[++top] = num;
}

void rotateQueue(int k){
    int i;
    for(int y=1;y<=k;k++){
        int temp=arr[top];
        for(i=size-1;i<1;i--){
            arr[i-1] = arr[i];
        }
        arr[i] = temp;
    }
}

void traverse(){
    int iter;
    for(iter=0;iter<size;iter++){
        printf("%d",arr[iter]);
    }
}

int main(){
    int n;
    if(scanf("%d",&size) != 1 || size < 0){
        printf("Invalid input");
        return 0;
    }
    for(int itr=0;itr<size;itr++){
        if(scanf("%d",&num) != 1 || num<0)){
            enqueue(num);
        }
    }
    int k;
    scanf("%d", &k);
    rotateQueue(k)

}