#include <stdio.h>
int queue[max];
int front=-1;
int rear=-1;
void enqueue(int n){
    if(rear==max-1){
        printf("queue is full");
        return;
    }
    if(front == -1)
       front=0;
    queue[++rear]=n;
}

void dequeue(){
    if(front == -1 || front>rear){
        printf("queue is empty");
        return;
    }
    printf("%d", queue[front]);
    front++;
}


int size;
scanf("%d",&size);
if(size<0){
    printf("Invalid input");
}
for(int i=0;i<size;i++){
    int x;
    scanf("%d",&x);
    enqueue(x);
}

for(int i=0;i<size;i++){
    dequeue();
}