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