#include<stdio.h>
int size=5,top=1;
int arr[5];
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;
    
}
void traverse(){
    for(int i=0;i<=size;i++){
        printf("%d ",arr[i]);
        printf("\n");
    }
    
}
int main(){
    int itr,num,size;
    scanf("%d",&size);
    for(itr=1;itr<=size;itr++){
        scanf("%d",&num);
        enqueue(num);
    }
    return 0;
}