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

int arr[20],top = -1;

int isfull(){
    if(top==size -1)
        return 1;
    else
        return 0;
}
void enQueue(int num){
    if(isfull())
        printf("queue is full\n");
    else
        arr[++top]=num;
}
int isempty(){
    if(top==-1){
        return 1;
    }
    else
        return 0;
}
int deQueue(int num){
    if(isempty()){
        printf("queue is empty");
        return 0;
    }
    else
        top--;
}
void traverse(){
    for(int i=0;i<top;i++){
        printf("%d",int->data);
    }
}
int main(){
    int size,num,itr;
    scanf("%d",&size);
    for(itr=0;itr<size;itr++){
        scanf("%d",&num);
        enqueue(num);
    }
    enqueue(num);
    dequeue();
    dequeue();
    dequeue();
    dequeue();
    dequeue();
    return 0;
}